← Morgan Stanley questions
CodingReported in a candidate post, Jul 2021

Max Root to Leaf Path

Filed under Morgan Stanley

Given a binary tree, find the path from the root to any leaf node such that the sum of the node values is maximized. Return the maximum sum.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Morgan Stanley questions

Collected from public candidate posts and coding forums. Updated Nov 2026.