Skip to main content

Two Sum IV - Input is a BST

Problem Statement​

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.

Leetcode Link

Examples:​

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

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

Code​

Python Code

class Solution:
    def findTarget(self, root: Optional[TreeNode], k: int) -> bool:
        def dfs(root, seen):
            if root == None: return False
            complement = k - root.val
            if complement in seen: return True
            seen.add(root.val)
            return dfs(root.left, seen) or dfs(root.right, seen)

        return dfs(root, set())