LeetCode 103. Binary Tree Zigzag Level Order Traversal

问题描述

• Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between).
• Example:
  
• 地址

问题分析

• 该题和 LeetCode 102. Binary Tree Level Order Traversal 以及 LeetCode 107. Binary Tree Level Order Traversal II 差不多相似。只不过这个是之字形打印二叉树
• 方法1 ： BFS + 双栈
  用两个栈 剑指offer-按之字形顺序打印二叉树 含具体解释
• 方法2：BFS + LinkedList
  存每一层的形成的 list时用双端队列 LinkedList,双端队列便可以实现从头插或者从尾插。这样便可以根据一个交错变化布尔值变量 order 来确定当前待入队的是从头插还是从尾插。便不用专门去 reverse。
• 当然，该题也可以用 LeetCode 107. Binary Tree Level Order Traversal II 介绍的 DFS的方法去解。根据当前层次的奇偶，来确定当前层形成的list 是从头插还是从尾插。

代码实现

• 双栈法

    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
        if (root == null) {
            return new ArrayList<>();
        }
        Stack<TreeNode> left2Right = new Stack<>();
        Stack<TreeNode> right2Left = new Stack<>();
        boolean order = true;
        List<List<Integer>> res = new ArrayList<>();
        left2Right.push(root);
        while (!left2Right.isEmpty() || ! right2Left.isEmpty()) {
            if (order) {
                List<Integer> list = new ArrayList<>();
                while (! left2Right.isEmpty()) {
                    TreeNode popNode = left2Right.pop();
                    list.add(popNode.val);
                    if (popNode.left != null) {
                        right2Left.push(popNode.left);
                    }
                    if (popNode.right != null) {
                        right2Left.push(popNode.right);
                    }
                }
                res.add(list);
            }else {
                List<Integer> list = new ArrayList<>();
                while (! right2Left.isEmpty()) {
                    TreeNode popNode = right2Left.pop();
                    list.add(popNode.val);
                    if (popNode.right != null) {
                        left2Right.push(popNode.right);
                    }
                    if (popNode.left != null) {
                        left2Right.push(popNode.left);
                    }
                }
                res.add(list);
            }
            order = ! order;
        }
        return res;
    }

• BFS + LinkedList

    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
        if (root == null) {
            return new ArrayList<>();
        }
        LinkedList<TreeNode> queue = new LinkedList<>();
        boolean order = true;
        List<List<Integer>> res = new ArrayList<>();
        queue.add(root);
        while (! queue.isEmpty()) {
            int levelSize = queue.size();
            LinkedList<Integer> list = new LinkedList<>();
            for (int i = 0; i < levelSize; i++) {
                TreeNode popNode = queue.remove();
                //根据order来确定插入位置
                if (order) {
                    list.addLast(popNode.val);
                }else {
                    list.addFirst(popNode.val);
                }
                //order? list.addLast(popNode.val) : list.addFirst(popNode.val);
                if (popNode.left != null) {
                    queue.add(popNode.left);
                }
                if (popNode.right != null) {
                    queue.add(popNode.right);
                }
            }
            res.add(list);
            order = ! order;
        }
        return res;
    }