剑指offer第2版32题：从上到下打印二叉树

小渣渣的算法学习笔记：2018秋招备战


数据结构类算法总结：二叉树

1.题目描述：

从上往下打印出二叉树的每个节点，同层节点从左至右打印。

2.代码实现：

public class Solution32 {
    private static class TreeNode {
        int val = 0;
        TreeNode left = null;
        TreeNode right = null;
        public TreeNode(int val) {
            this.val = val;
        }
    }

    public static void main(String[] args) {
        Solution32 s = new Solution32();
        TreeNode t1 = new TreeNode(8);
        TreeNode t2 = new TreeNode(6);
        TreeNode t3 = new TreeNode(10);
        TreeNode t4 = new TreeNode(5);
        TreeNode t5 = new TreeNode(7);
        TreeNode t6 = new TreeNode(9);
        TreeNode t7 = new TreeNode(11);

        t1.left = t2;
        t1.right = t3;
        t2.left = t4;
        t2.right = t5;
        t3.left = t6;
        t3.right = t7;

        ArrayList<Integer> arr = s.PrintFromTopToBottom(t1);
        for(int i:arr){
            System.out.print(i+" ");
        }
    }

    public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
        ArrayList<Integer> list = new ArrayList<Integer>();
        if(root==null){
            return list;
        }
        Queue<TreeNode> queue = new LinkedList<TreeNode>();
        queue.offer(root);//offer()如果在不违反容量限制的情况下立即执行，则将指定的元素插入到此队列中
        while(!queue.isEmpty()){
            //poll()检索并删除此队列的头，如果此队列为空，则返回 null
            TreeNode treeNode = queue.poll();
            if(treeNode.left!=null) queue.offer(treeNode.left);
            if(treeNode.right!=null) queue.offer(treeNode.right);
            list.add(treeNode.val);
        }
        return list;
    }

}