LeetCode-103. 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,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

return its zigzag level order traversal as:

[
  [3],
  [20,9],
  [15,7]
]

题目：二叉树的弯曲层次遍历，即从上往下层次遍历二叉树，第一层从左往右，第二层从右往左。

思路：还是在二叉树的层次遍历上进行改动，对于二叉树层次遍历返回的ret，增加：对于ret[i]，如果i为奇数，则reverse(ret[i].begin(),ret[i].end())即可

代码：

class Solution {
public:
    vector<vector<int> > zigzagLevelOrder(TreeNode* root) {
        vector<vector<int> > ret;
        if(!root)
        	return ret;
        queue<TreeNode*> q;
		q.push(root);
		while(!q.empty()){
			vector<int> temp;
			int size = q.size();
			for(;size>0;size--){
				TreeNode* node = q.front();
				temp.push_back(node->val);
				q.pop();
				if(node->left)
					q.push(node->left);
				if(node->right)
					q.push(node->right);
			}
			ret.push_back(temp);	
		}
		int size = ret.size();
		for(int i=0;i<size;i++) //增加的操作：对于i为奇数的行进行反转。
			if(i%2!=0)
				reverse(ret[i].begin(),ret[i].end());
		return ret;
    }
};

AC,beats 100%