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

代码如下：

/**
 * Definition for binary tree
 * 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> > result;
        if (!root) return result;
        deque<TreeNode*> temp;
        temp.push_back(root);
        int row = 1;
        while (!temp.empty()) {
            vector<int> v;
            deque<TreeNode*> d;
            while (temp.size()) {
                TreeNode* t;
                if (row % 2) {
                    t = temp.front();
                    v.push_back(t->val);
                    if (t->left) d.push_back(t->left);
                    if (t->right) d.push_back(t->right);
                    temp.pop_front();
                } else {
                    t = temp.back();
                    v.push_back(t->val);
                    if (t->right) d.push_front(t->right);
                    if (t->left) d.push_front(t->left);
                    temp.pop_back();
                }
            }
            row++;
            temp = d;
            result.push_back(v);
        }
        return result;
    }
};

NOTE：主要是关于双端队列的应用。