二叉树的锯齿形层次遍历

思路：二叉树的层次遍历，遍历的时候用一个Boolean类型的值辨别方向是从左往右还是从右往左。

代码：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
        List<List<Integer>> list = new ArrayList<>();
        if (root == null) {
            return list;
        }
        Queue <TreeNode> q = new LinkedList<>();
        q.add(root);
        boolean b = true;
        while (!q.isEmpty()) {
            List <Integer> inlist = new ArrayList();
            int count = q.size();
            for (int i = 0; i < count; i++) {
                TreeNode node = q.poll();
                if (b) {
                    inlist.add(node.val);
                }
                else {
                    inlist.add(0,node.val);
                }
                if (node.left != null) {
                    q.add(node.left);
                }
                if(node.right != null) {
                    q.add(node.right);
                }
            }
            list.add(inlist);
            b = !b;
        }
        return list;
    }
}