-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
700.java
45 lines (43 loc) · 1.24 KB
/
700.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
__________________________________________________________________________________________________
sample 0 ms submission
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode searchBST(TreeNode root, int val) {
if(root==null||root.val==val) return root;
if(root.val<val){
return searchBST(root.right,val);
} else{
return searchBST(root.left,val);
}
}
}
__________________________________________________________________________________________________
sample 38192 kb submission
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode searchBST(TreeNode root, int val) {
if(root == null || root.val == val)
return root;
if(root.val >= val)
return searchBST(root.left, val);
else
return searchBST(root.right, val);
}
}
__________________________________________________________________________________________________