很简单,就是利用图的BFS算法即可,代码如下
import java.util.ArrayList;
import java.util.Queue;
import java.util.LinkedList;
/**
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> al=new ArrayList<Integer>();
if(root==null)
return al;
Queue<TreeNode> q=new LinkedList<TreeNode>();
q.add(root);
while(!q.isEmpty()){
TreeNode t=q.poll();
al.add(t.val);
if(t.left!=null)
q.add(t.left);
if(t.right!=null)
q.add(t.right);
}
return al;
}
}