Divide binary tree into two halves with minimum sum difference
Filed under Medlife
The question
Divide a normal binary tree into two halves such that the difference between the sum of nodes of both subtrees is minimized.
No write-up yet. Related questions below have one.
Related Medlife questions
Collected from public candidate posts and coding forums. Updated Nov 2026.