Two nodes sum in binary tree
Filed under Sahaj Software Solutions
The question
Given a binary tree and a sum X, find if any two nodes sum to X with complexity better than O(n^2).
No write-up yet. Related questions below have one.
Related Sahaj Software Solutions questions
Collected from public candidate posts and coding forums. Updated Nov 2026.