-
Notifications
You must be signed in to change notification settings - Fork 0
/
JianZhi022.java
35 lines (32 loc) · 906 Bytes
/
JianZhi022.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
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Deque;
/**
* @ProjectName: LeetCode
* @Author: XinyuLiu
* @Description:
*/
public class JianZhi022 {
//1.DFS(队列)
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
ArrayList<Integer> list = new ArrayList<>();
if(root == null) return list;
Deque<TreeNode> deque = new ArrayDeque<>();
deque.addLast(root);
while(!deque.isEmpty()){
TreeNode node = deque.pollFirst();
list.add(node.val);
if(node.left != null) deque.addLast(node.left);
if(node.right != null) deque.addLast(node.right);
}
return list;
}
}