描述
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
示例1
输入:
{5,4,#,3,#,2,#,1}
复制返回值:
[5,4,3,2,1]
public class Jz22_PrintFromTopToBottom {
public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
ArrayList<Integer> ans = new ArrayList<>();
if(null == root){
return ans;
}
ArrayList<TreeNode> arr = new ArrayList<>();
arr.add(root);
int pos = 0;
while(pos != arr.size()){
TreeNode treeNode = arr.get(pos);
ans.add(treeNode.val);
pos++;
if(null != treeNode.left){
arr.add(treeNode.left);
}
if(null != treeNode.right){
arr.add(treeNode.right);
}
}
return ans;
}
private void recordRowOftree(){
}
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
}