题目
从上往下打印出二叉树的每个节点,同层节点从左至右打印
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> ans=new ArrayList<Integer>();
if(root ==null ) return ans;
Deque<TreeNode> deque=new LinkedList<>();
deque.add(root);
int size=1;
while(!deque.isEmpty()){
size=deque.size();
for(int i=0;i<size;i++){
TreeNode node= deque.pop();
ans.add(node.val);
if(node.left!=null) deque.add(node.left);
if(node.right!=null) deque.add(node.right);
//size=deque.size();
}
}
return ans;
}
}