g0601_0700.s0653_two_sum_iv_input_is_a_bst

Class Solution

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

Constructor Summary

Constructors

Constructor and Description
Solution()

Method Summary

Modifier and Type	Method and 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)