Binary Tree Zigzag Level Order Traversal(leetcode)

题目：

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

https://oj.leetcode.com/problems/binary-tree-zigzag-level-order-traversal/

解题思路：树层次遍历，只是在遍历每层时先判断这层的奇偶性，如果是偶数，则把遍历此层的结果反转。

#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;

struct TreeNode 
{
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

vector<vector<int> > zigzagLevelOrder(TreeNode *root)
{
	vector<vector<int> >results;
	if(root==NULL)
		return results;
	queue<TreeNode *> q;
	q.push(root);
	int k=0,level=1;
	while(!q.empty())
	{
		k=level;
		level=0;
		vector<int> result;
		for(int i=0;i<k;i++)
		{
			result.push_back(q.front()->val);
			if(q.front()->left!=NULL)
			{
				q.push(q.front()->left);
				level++;
			}
			if(q.front()->right!=NULL)
			{
				q.push(q.front()->right);
				level++;
			}
			q.pop();
		}
		if(results.size()&1)
		{
			reverse(result.begin(),result.end());
			results.push_back(result);
		}
		else
			results.push_back(result);
	}
	return results;
}

int main()
{
	TreeNode* root=new TreeNode(1);
	root->left=new TreeNode(2);
	root->right=new TreeNode(3);
	root->left->left=new TreeNode(4);
	root->right->left=new TreeNode(5);
	vector<vector<int> > results=zigzagLevelOrder(root);

	system("pause");
	return 0;
}