Leetcode题解（6）：L103/Binary Tree Zigzag Level Order Traversal

L103: 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]
]

解题思路：跟之前的Binary Tree Level Order Traversal很相似，只不过是偶数层要倒过来，有三种思路：
1）跟之前Binary Tree Level Order Traversal一样，增加一个信号表示奇层还是偶层，偶层的话将其倒转
2）两个stack交替使用
3）采用一个deque，在头尾交替操作

//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>> levelOrdVec;

        if(root == 0)
            return levelOrdVec;

        deque<TreeNode*> nodeDeque;
        TreeNode* mark = nullptr;

        nodeDeque.push_back(root);
        nodeDeque.push_back(mark);
        bool back = false;

        while(nodeDeque.size()>1)
        {
            vector<int> ordVec;
            TreeNode* node = nullptr;
            if(back == false)
            {
                while((node = nodeDeque.front()) != mark)
                {
                    nodeDeque.pop_front();
                    ordVec.push_back(node->val);
                    if(node->left) nodeDeque.push_back(node->left);
                    if(node->right) nodeDeque.push_back(node->right);
                }
                back = true;
            }
            else
            {
                while((node = nodeDeque.back()) != mark)
                {
                    nodeDeque.pop_back();
                    ordVec.push_back(node->val);
                    if(node->right) nodeDeque.push_front(node->right);
                    if(node->left) nodeDeque.push_front(node->left);
                }
                back = false;
            }
            levelOrdVec.push_back(ordVec);          
        }
        return move(levelOrdVec);
    }
};