We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 3838f84 commit 0e0ab5eCopy full SHA for 0e0ab5e
src/main/java/com/fishercoder/solutions/_653.java
@@ -5,35 +5,6 @@
5
import java.util.ArrayList;
6
import java.util.List;
7
8
-/**
9
- * 653. Two Sum IV - Input is a BST
10
- *
11
- * Given a Binary Search Tree and a target number,
12
- * return true if there exist two elements in the BST such that their sum is equal to the given target.
13
-
14
- Example 1:
15
- Input:
16
- 5
17
- / \
18
- 3 6
19
- / \ \
20
-2 4 7
21
22
-Target = 9
23
-Output: True
24
25
-Example 2:
26
-Input:
27
28
29
30
31
32
33
-Target = 28
34
-Output: False
35
36
- */
37
public class _653 {
38
39
public static class Solution1 {
0 commit comments