-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathP_199.java
More file actions
52 lines (46 loc) · 1.38 KB
/
Copy pathP_199.java
File metadata and controls
52 lines (46 loc) · 1.38 KB
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
package leetcode.medium;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Deque;
import java.util.List;
import utils.DataStructures.TreeNode;
public class P_199 {
public List<Integer> rightSideView(TreeNode root) {
final List<Integer> res = new ArrayList<>();
final Deque<TreeNode> dq = new ArrayDeque<>();
if (root != null) {
dq.offerLast(root);
}
while (!dq.isEmpty()) {
final int levelSize = dq.size();
for (int i = 0; i < levelSize; i++) {
final TreeNode curr = dq.removeFirst();
if (i == 0) {
res.add(curr.val);
}
if (curr.right != null) {
dq.offerLast(curr.right);
}
if (curr.left != null) {
dq.offerLast(curr.left);
}
}
}
return res;
}
public List<Integer> rightSideViewDfs(TreeNode root) {
final List<Integer> res = new ArrayList<>();
dfs(root, res, 0);
return res;
}
public void dfs(TreeNode node, List<Integer> res, int depth) {
if (node == null) {
return;
}
if (depth == res.size()) {
res.add(node.val);
}
dfs(node.right, res, depth + 1);
dfs(node.left, res, depth + 1);
}
}