-
Notifications
You must be signed in to change notification settings - Fork 11
/
RightSideView.java
33 lines (30 loc) · 928 Bytes
/
RightSideView.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
import java.util.ArrayList;
import java.util.Deque;
import java.util.LinkedList;
import java.util.List;
public class RightSideView {
public List<Integer> rightSideView(TreeNode root) {
if(root == null){
return new ArrayList<Integer>();
}
Deque<TreeNode> deque = new LinkedList<>();
deque.addLast(root);
ArrayList<Integer> res = new ArrayList<>();
while (!deque.isEmpty()){
int m = deque.size();
for (int i = 0; i < m; i++) {
TreeNode node = deque.pollFirst();
if (i == m-1){
res.add(node.val);
}
if (node.left != null){
deque.addLast(node.left);
}
if (node.right != null){
deque.addLast(node.right);
}
}
}
return res;
}
}