← Amazon questions

Maximum sum in binary tree with no adjacent nodes

Filed under Amazon

Find the maximum sum of nodes in a binary tree such that no two selected nodes are directly connected (parent and 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 Amazon questions

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