Binary Tree Node Sum

Problem Overview

Given two complete binary trees with identical structure (same number of nodes, same topology), modify each node in the second tree so that its value equals the sum of all node values in the corresponding subtree (including the root of that subtree) from the first tree. In a simpler variant:…

• 3 candidate-reported follow-ups — the exact probes interviewers asked, with the trigger for each
• The rest of the problem statement — full requirements, constraints, and edge cases
• Approach and trade-offs — what passing candidates did, and the mistakes that sink people