从上到下打印二叉树

题目描述

代码

//广度优先搜索BFS，使用队列的先进先出特性
/**
 * 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<>();
        //创建链表，存放节点
        ArrayList<Integer> list = new ArrayList<>();
    
        queue.add(root);
        
        while(!queue.isEmpty()){
            TreeNode node = queue.poll();
            list.add(node.val);
            if(node.left != null){
                queue.add(node.left);
            }
            if(node.right != null){
                queue.add(node.right);
            }
        }
        
        int[] res = new int[list.size()];
        
        for(int i = 0;i < list.size();i ++){
            res[i] = list.get(i);
        }
        
        return res;


    }
}