Binary Tree Zigzag Level Order Traversal

最新推荐文章于 2019-02-09 10:18:26 发布

Andrewseu

最新推荐文章于 2019-02-09 10:18:26 发布

阅读量2.9k

点赞数

分类专栏： LeetCode 文章标签：二叉树层次遍历非递归

本文链接：https://blog.csdn.net/Andrewseu/article/details/27709453

版权

LeetCode 专栏收录该内容

51 篇文章 0 订阅

订阅专栏

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},

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.

层次遍历的变形，但本质还是一样的，主要是要设置一个标志来表明是从左往右还是从右往左。这里用的是一个枚举类型enum{L,R};每遍历一层，对方向进行一个转变。

/**
 * Definition for binary tree
 * 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) {
	vector<vector<int>>result;
	if (!root)
		return result;
	vector<int>vec;
	queue<TreeNode*>q1;
	TreeNode *temp = root;
	enum Dir{L,R};
	Dir dir = L;
	q1.push(root);
	
	while (!q1.empty())
	{
		queue<TreeNode *>q2;
		while (!q1.empty())
		{
			temp = q1.front();
			q1.pop();
			if (temp->left)
				q2.push(temp->left);
			if (temp->right)
				q2.push(temp->right);
			vec.push_back(temp->val);
		}
		if (dir == R)
		{
			reverse(vec.begin(), vec.end());
			dir = L;
		}
		else
			dir = R;
		result.push_back(vec);
		vec.clear();
		q1 = q2;
	}
	return result;
	}
};