从上到下打印二叉树
从上到下打印出二叉树的每个节点,同一层的节点按照从左到右的顺序打印。
核心思想:采用队列实现
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int[] levelOrder(TreeNode root) {
//使用队列,当前结点出队,就把当前结点的左右子结点都入队,直到队列为空
if(root == null){
return new int[0];
}
Queue<TreeNode> queue = new LinkedList<TreeNode>();
List<Integer> list = new ArrayList<Integer>();
int count = 0;
queue.add(root);
while(!queue.isEmpty()){
TreeNode cur = queue.poll();
list.add(cur.val);
count++;
if(cur.left != null){
queue.add(cur.left);
}
if(cur.right != null){
queue.add(cur.right);
}
}
int[] numbers = new int[count];
for(int i = 0; i < count; i++){
numbers[i] = list.get(i);
}
return numbers;
}
}