Find two nodes in a BST with a given sum
Filed under Snapdeal
The question
Given a Binary Search Tree and a target value k, identify whether there exist two nodes in the tree whose values add up to k.
No write-up yet. Related questions below have one.
Related Snapdeal questions
Collected from public candidate posts and coding forums. Updated Nov 2026.