二叉树的锯齿形层序遍历

题目

题源

代码

用广度优先思想解决此问题：

class Solution {
    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
        List<List<Integer>> ans = new LinkedList<List<Integer>>();
        if (root == null)
            return ans;

        Queue<TreeNode> nodeQueue = new LinkedList<TreeNode>();
        nodeQueue.offer(root);
        boolean isLeft = true;      
        while (!nodeQueue.isEmpty()) {
            Deque<Integer> list = new LinkedList<Integer>();
            int size = nodeQueue.size();
            for (int i = 0; i < size; i++) {
                TreeNode tn = nodeQueue.poll();
                if (isLeft) {
                    list.offerLast(tn.val);
                } else {
                    list.offerFirst(tn.val);
                }                   
                if (tn.left != null)
                    nodeQueue.offer(tn.left);
                if (tn.right != null)
                    nodeQueue.offer(tn.right);
            }
            isLeft = !isLeft;
            ans.add(new LinkedList<Integer>(list));
        }
        
        return ans;
    }
}