Solution (leetcode-in-java 1.21 API)

java.lang.Object
- g0601_0700.s0653_two_sum_iv_input_is_a_bst.Solution

```
public class Solution
extends Object
```
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:

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, 10⁴].
- -10⁴ <= Node.val <= 10⁴
- root is guaranteed to be a valid binary search tree.
- -10⁵ <= k <= 10⁵

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  boolean findTarget(TreeNode root, int k)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

findTarget

public boolean findTarget(TreeNode root,
                          int k)