653. Two Sum IV - Input is a BST
Easy
Given the root
of a Binary Search Tree and a target number k
, return true
if there exist two elements in the BST such that their sum is equal to the given target.
Example 1:
Example 2:
Constraints:
The number of nodes in the tree is in the range
[1, 104]
.-104 <= Node.val <= 104
root
is guaranteed to be a valid binary search tree.-105 <= k <= 105
解題
Runtime: 29 ms, faster than 81.78%
Memory Usage: 7.1 MB, less than 91.01%
Last updated