← Amazon questions
CodingReported in a candidate post, Apr 2013

Find two numbers with sum k in BST without extra space

Filed under Amazon

Given a Binary Search Tree and a target sum k, find two nodes whose values sum to k.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

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