leetcode 103. Binary Tree Zigzag Level Order Traversal

最新推荐文章于 2019-09-16 17:01:25 发布

qq_34860720

最新推荐文章于 2019-09-16 17:01:25 发布

阅读量88

点赞数 1

分类专栏： C++ leetcode

本文链接：https://blog.csdn.net/qq_34860720/article/details/94982600

版权

C++ 同时被 2 个专栏收录

34 篇文章 0 订阅

订阅专栏

leetcode

30 篇文章 0 订阅

订阅专栏

/**
 * Definition for a binary tree node.
 * 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) {
	queue<TreeNode*> que;
	vector<vector<int>> vec;
	vector<int> tmp;
	int flag = 2;// from left to right
	TreeNode* mark = new TreeNode(0);
	if (root != NULL) {// 
		que.push(root);
		que.push(mark);
	}
	while (!que.empty()) {
		TreeNode* stmp = que.front();
		que.pop();// front pop
		if (stmp == mark) {
			if (que.size() > 0) {// 遇到标记，且que.size>0说明上一层已经遍历完毕，放入标记作为下一个遍历标记
				que.push(mark);
			}
            if (flag == 1) {
				flag = 2;
				reverse(tmp.begin(), tmp.end());
			}
			else
				flag = 1;
			vec.push_back(tmp);// que.size()==0 && vec.push_back(tmp) is process to end
			tmp.clear();
		}
		else {//
			if (stmp != mark) {
				tmp.push_back(stmp->val);
			}
			if (stmp->left != NULL)
				que.push(stmp->left);
			if (stmp->right != NULL)// 如果这边叶子节点放入左右孩子为NULL,遇到标记极为最后一个标记，结束
				que.push(stmp->right);
		}
	}
	return vec;
}
};