leetcode question 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).

For example:
Given binary tree [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

return its zigzag level order traversal as:

[
  [3],
  [20,9],
  [15,7]
]

分析：

这道题和leetcode question 102 很像，区别就是这道题层的输出顺序是交叉的，前一层是从左到右，这一层就是从右到左，下一层又变成从左到右。因此解法完全可以借用102题的解法，只需要在输出的时候做一些处理就好了。下面上代码：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
        vector<vector<int>> ans;
        
        if( root == NULL ){
            return ans;
        }
        
        vector<TreeNode*> nodes;
        int flag = 0 ;
        nodes.push_back(root);
        
        while( !nodes.empty() ){
            vector<TreeNode*> temp;
            vector<int> nums;
            
            //将下一层节点输入到temp中
            for( int i = 0 ; i < nodes.size() ; i ++ ){
                if( nodes[i] -> left != NULL ){
                    temp.push_back(nodes[i]->left);
                }
                if( nodes[i] -> right != NULL ){
                    temp.push_back(nodes[i]->right);
                }
            }
            
            //根据flag输出当前层节点值
            if( flag % 2 == 0 ){
                for( int i = 0 ; i < nodes.size() ; i ++ ){
                    nums.push_back(nodes[i]-> val);
                }
            }else{
                for( int i = nodes.size() - 1 ; i >= 0 ; i-- ){
                    nums.push_back(nodes[i]-> val);
                }
            }
            
            flag ++;//更新下一层的输出顺序
            ans.push_back(nums);
            nodes = temp;
        }
        
        return ans;
    }
};