-
Notifications
You must be signed in to change notification settings - Fork 13
/
SearchRangeLintcode11.java
53 lines (49 loc) · 1.23 KB
/
SearchRangeLintcode11.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
package Leetcode;
import Leetcode.TreeNode;
import java.util.ArrayList;
import java.util.List;
import java.util.Stack;
public class SearchRangeLintcode11 {
/**
* @param root: param root: The root of the binary search tree
* @param k1: An integer
* @param k2: An integer
* @return: return: Return all keys that k1<=key<=k2 in ascending order
*/
public List<Integer> searchRange(TreeNode root, int k1, int k2) {
// write your code here
List<Integer> res = new ArrayList<>();
if(root == null) {
return res;
}
Stack<TreeNode> stack = new Stack<>();
TreeNode cur = root;
while(cur != null || !stack.isEmpty()) {
while (cur != null) {
stack.push(cur);
cur = cur.left;
}
if(!stack.isEmpty()) {
cur = stack.pop();
if(cur.val >= k1 && cur.val <= k2) {
res.add(cur.val);
}
}
cur = cur.right;
}
return res;
}
//Definition for a binary tree node.
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode() {}
TreeNode(int val) { this.val = val; }
TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
}
}