← Morgan Stanley questions

Maximum sum of nodes in a binary tree such that no two are adjacent

Filed under Morgan Stanley

Given a binary tree, find the maximum sum of node values such that no two selected nodes are directly connected by an edge (i.e., parent-child).

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.