#653
Two Sum IV - Input is a BST
easy · verified · 63.1% accepted · 7,261 likes · top 65%
hash table · two pointers · tree · depth-first search · breadth-first search · binary search tree · binary tree
Description
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.
Example 1:
Input: root = [5,3,6,2,4,null,7], k = 9
Output: true
Example 2:
Input: root = [5,3,6,2,4,null,7], k = 28
Output: false
Solution