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.

思想：

可以利用层次遍历的思想，只需添加一个bool型的变量，用于控制是从左到右输出，还是从右到左输出，对于从左到右输出，无需处理temp，但对于从右到左需要将temp中的元素进行逆转操作。

代码：

/**
* Definition for a binary tree node.
*/
typedef struct TreeNode {
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x) : val(x), left(NULL), right(NULL) {}
}*BinaryTree;

class Solution {
public:

	void CreateTree(BinaryTree &T)//创建二叉树
	{
		char data;
		cin >> data;
		if (data == '#')
			T = NULL;
		else
		{
			T = new TreeNode(data - '0');
			CreateTree(T->left);
			CreateTree(T->right);
		}
	}

	vector<vector<int>> levelOrder(TreeNode* root) {
		vector<vector<int> >ret;
		vector<int > temp;
		if (root == NULL)
			return ret;
		queue< TreeNode *> q;
		TreeNode *p=root;
		//TreeNode *Tag = new TreeNode();
		bool flag = false; //用于判定是从右到左还是从左到右输出
		q.push(p);
		q.push(NULL);
		while (!q.empty())
		{
			p = q.front();
			while (p != NULL)
			{
				q.pop();
				temp.push_back(p->val);
				if (p->left != NULL)
				{
					q.push(p->left);
				}
				if (p->right != NULL)
				{
					q.push(p->right);
				}
				p = q.front();
			}
			
			q.pop();
			if (flag)
			{
				reverse(temp.begin(), temp.end()); //逆转
				ret.push_back(temp);
			}
			else
			{
				ret.push_back(temp);
			}
			flag = !flag;
			temp.clear();

			if (!q.empty())
			{
				q.push(NULL);			
			}
			
		}
		return ret;
	}

};