leetcode103 - 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).
大意：将二叉树层次遍历一行正序一行倒序输出。
我个人的做法就是先将二叉树层次遍历，然后把逆转奇数行的数据。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    void reverseArr(vector<int>&arr){
        for(auto i = 0; i < arr.size() / 2; i++)
            std::swap(arr[i], arr[arr.size() - 1 - i]);
    }
    void zigzag(TreeNode* root, int height, vector<vector<int>>&trees){
        if(root != nullptr){
            if (height >= trees.size()) {
                vector<int>tree = {root->val};
                trees.push_back(tree);
            }
            else trees[height].push_back(root->val);
            zigzag(root->left,height + 1,trees);
            zigzag(root->right,height + 1,trees);
        }
    }
    vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
        vector<vector<int>>tree;
        zigzag(root, 0, tree);
        for(auto i=0; i< tree.size(); i++)
            if(i % 2 == 1)reverseArr(tree[i]);
        return tree;
    }
};