-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
669.java
62 lines (60 loc) · 1.79 KB
/
669.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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
__________________________________________________________________________________________________
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 trimBST(TreeNode root, int L, int R) {
return trimBSTRec(root, L, R);
}
public TreeNode trimBSTRec(TreeNode root, int L, int R) {
if (root == null) {
return null;
}
if (root.val < L) {
return trimBSTRec(root.right, L, R);
} else if (root.val > R) {
return trimBSTRec(root.left, L, R);
} else {
root.left = trimBSTRec(root.left, L, R);
root.right = trimBSTRec(root.right, L, R);
return root;
}
}
}
__________________________________________________________________________________________________
sample 37568 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 trimBST(TreeNode root, int L, int R) {
if (root == null) {
return null;
} else {
if (root.val < L) {
return trimBST(root.right, L, R);
} else if (root.val > R) {
return trimBST(root.left, L, R);
} else {
// root.val lies in [L, R]
root.left = trimBST(root.left, L, R);
root.right = trimBST(root.right, L, R);
return root;
}
}
}
}
__________________________________________________________________________________________________