LeetCode 題解（32）: 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.

OJ's Binary Tree Serialization:

The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.

Here's an example:

1
  / \
 2   3
    /
   4
    \
     5
      

The above binary tree is serialized as

"{1,2,3,#,#,4,#,#,5}"

.

題解：

用一個bool變量表示正向或反向，用deque代替queue，因為deque可以正向周遊，也可反向周遊。每一層節點入queue後，在queue最後加入一個NULL節點。每次NULL節點出隊列時，正向或反向掃描queue中目前的節點val，并儲存在vector中，周遊完成後在queue中加入NULL節點。每次彈出NULL節點時，先判斷隊列是否為空，若為空，則說明目前NULL節點是最後一個節點，跳出循環，傳回。

class Solution {
public:
    vector<vector<int> > zigzagLevelOrder(TreeNode *root) {
        vector<vector<int>> result;
        
        if(!root)
            return result;
        
        vector<int> temp;
        temp.push_back(root->val);
        result.push_back(temp);
        bool reverse = false;
        deque<TreeNode*> nodeQ;
        nodeQ.push_back(root);
        nodeQ.push_back(NULL);
        
        reverse = !reverse;
        temp.erase(temp.begin(), temp.end());
        
        while(!nodeQ.empty())
        {
            TreeNode* node = nodeQ.front();
            nodeQ.pop_front();
            
            if(node)
            {
                if(node->left)
                    nodeQ.push_back(node->left);
                if(node->right)
                    nodeQ.push_back(node->right);
            }
            else
            {
                if(nodeQ.empty())
					break;
				if(reverse)
                {
                    for(deque<TreeNode*>::reverse_iterator rit = nodeQ.rbegin(); rit != nodeQ.rend(); rit++)
                    {
                        temp.push_back((*rit)->val);
                    }
                }
                else
                {
                    for(deque<TreeNode*>::iterator it = nodeQ.begin(); it != nodeQ.end(); it++)
                    {
                        temp.push_back((*it)->val);
                    }
                }
                reverse = !reverse;
                result.push_back(temp);
                temp.erase(temp.begin(), temp.end());
                nodeQ.push_back(NULL);
            }
        }
        return result;
    }
};