32 从上到下打印二叉树

层次遍历二叉树

1. 普通层次遍历

public static void levelOrder(TreeNode root) {
    if (root == null) return;
    Queue<TreeNode> queue = new LinkedList<>();
    queue.offer(root);
    while (!queue.isEmpty()) {
        TreeNode temp = queue.remove();
        System.out.print(temp.getData() + "\t");
        if (temp.getLeftChild() != null) queue.offer(temp.getLeftChild());
        if (temp.getRightChild() != null) queue.offer(temp.getRightChild());
    }
}

2. 每层换行的层次遍历

public static void levelByLevelOrder(TreeNode root) {
        if (root == null) return;
        Queue<TreeNode> queue = new LinkedList<>();//java中linkedList实现了queue接口
        queue.offer(root);//offer 向队尾添加 添加失败返回null不会发出异常
        int needPrintln = 1;//为0时换行
        int levelNodeNum = 0;//每层节点的数量
        while (!queue.isEmpty()) {
            TreeNode temp = queue.remove();
            System.out.print(temp.getData() + "\t");
            if (temp.getLeftChild() != null) {
                queue.offer(temp.getLeftChild());
                levelNodeNum++;
            }
            if (temp.getRightChild() != null) {
                queue.offer(temp.getRightChild());
                levelNodeNum++;
            }
            needPrintln--;
            if (needPrintln == 0) {
                System.out.println();
                needPrintln = levelNodeNum;
                levelNodeNum = 0;
            }
        }
    }

3. Z字形的层次遍历

/**
     * Z字形层次遍历
     * 解释：
     * 如果一个层次遍历是
     * 1
     * 2    3
     * 4  5  6 7
     * 
     * 按照Z字形遍历结果
     * 1
     * 3    2
     * 4  5  6 7
     */
    public static void zLevelOrder(TreeNode root) {
        if (root == null) return;
        List<Stack<TreeNode>> stacks = new ArrayList<Stack<TreeNode>>();
        stacks.add(new Stack<TreeNode>());
        stacks.add(new Stack<TreeNode>());
        int current = 0;
        int next = 1;
        stacks.get(current).push(root);
        while (!stacks.get(0).isEmpty() || !stacks.get(1).isEmpty()) {
            TreeNode temp = stacks.get(current).pop();
            System.out.print(temp.getData()+"\t");
            if (current == 0) {
                if (temp.getLeftChild() != null)
                    stacks.get(next).push(temp.getLeftChild());
                if (temp.getRightChild() != null)
                    stacks.get(next).push(temp.getRightChild());
            } else {
                if (temp.getRightChild() != null)
                    stacks.get(next).push(temp.getRightChild());
                if (temp.getLeftChild() != null)
                    stacks.get(next).push(temp.getLeftChild());
            }
            if(stacks.get(current).isEmpty()){
                System.out.println();
                current=1-current;
                next=1-next;
            }
        }
    }

详细代码 https://github.com/Zbeginner/offer