← Morgan Stanley questions

Maximum Root to Leaf Path Sum

Filed under Morgan Stanley

Given a binary tree, find the maximum path sum from the root to any leaf node. A path is defined as a sequence of nodes from the root to a leaf.

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.