从上往下打印出二叉树的每个节点,同层节点从左至右打印。
解析:层序遍历
代码:
import java.util.*;
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
ArrayList<Integer> res = new ArrayList<>();
if(root == null){
return res;
}
LinkedList<TreeNode> queue = new LinkedList<>();
queue.add(root);
while(queue.size() != 0){
TreeNode temp = queue.remove(0);
if(temp.left != null){
queue.add(temp.left);
}
if(temp.right != null){
queue.add(temp.right);
}
res.add(temp.val);
}
return res;
}
}