← InMobi questions

Maximum Sum Nodes in Binary Tree with No Two Adjacent

Filed under InMobi

The question

Given a binary tree, find the maximum sum of nodes such that no two selected nodes are directly connected (adjacent).

No write-up yet. Related questions below have one.

Related InMobi questions

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