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,#,#,15,7},

    3
   / \
  9  20
    /  \
   15   7

return its zigzag level order traversal as:

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

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

Subscribe to see which companies asked this question

分析：

显然简单的做法是层遍历，然后对奇数列反转。

更正确的做法应该是直接奇数列反向插入。

下次再优化。

/**
 * 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<int> v1;
        vector<vector<int>> v2;
        if(root==NULL) return v2;
        queue<TreeNode*> q1;        stack<TreeNode*> s1;
        q1.push(root);
        bool index=true;
        int len=1;
        while(!q1.empty())
        {
          
        //   if(!index)  
        //   {
        //   for(int i=0;i<len;++i)
        //   {s1.push(q1.front()); q1.pop();}
        //   for(int i=0;i<len;++i)
        //   { q1.push(s1.top());s1.pop();}
        //   }
            TreeNode* root=q1.front();
            q1.pop();
            v1.push_back(root->val);
            --len;
            if(root->left)q1.push(root->left);
            if(root->right) q1.push(root->right);
            if(len==0)
            {
                // index=index?false:true;  
                v2.push_back(v1);
                len=q1.size();
                v1.clear();
            }


        }
        for(int i=0;2*i+1<v2.size();++i)
       {int  t=2*i+1; reverse(v2[t].begin(),v2[t].end());}
        return v2;
    }
};