Given the root of a Binary Search Tree and an integer k, return true if there exist two elements in the BST such that their sum is equal to k, or false otherwise.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.