Binary Tree Zigzag Level Order Traversal 二叉树的之字形层序遍历

最新推荐文章于 2021-04-23 09:22:08 发布

weixin_41157881

最新推荐文章于 2021-04-23 09:22:08 发布

阅读量84

点赞数

分类专栏： C++ 文章标签：二叉树遍历

本文链接：https://blog.csdn.net/weixin_41157881/article/details/97319764

版权

C++ 专栏收录该内容

200 篇文章 1 订阅

订阅专栏

#include
#include
#include
#include
#include
using namespace std;
struct TreeNode
{
int val;
TreeNode lChild;
TreeNode rChild;
TreeNode(int val, TreeNodel = nullptr, TreeNoder = nullptr)
{
this->val = val;
this->lChild = l;
this->rChild = r;
}
};
TreeNode *create(int intarr[], int length, int i)
{
TreeNode *node = nullptr;

if (i < length && intarr[i] != -1)
{
	node = new TreeNode(intarr[i]);
	node->lChild = create(intarr, length, i * 2 + 1);
	node->rChild = create(intarr, length, i * 2 + 2);
}
return node;

}
void ZigzagLevelOrderTraversal(TreeNode *node)
{
stack<TreeNode *> treestack1;
stack<TreeNode *> treestack2;
int res = 0;
treestack1.push(node);
while ((!treestack1.empty()) || (!treestack2.empty()))
{
if (res % 2 == 0)
{
while (!treestack1.empty())
{
TreeNode *temp = treestack1.top();
cout << temp->val << " ";
if (temp->lChild)
treestack2.push(temp->lChild);
if (temp->rChild)
treestack2.push(temp->rChild);

			treestack1.pop();
		}
		res++;
		cout<<endl;
	}
	else
	{
		while (!treestack2.empty())
		{
			TreeNode *temp = treestack2.top();
			cout << temp->val << " ";
			if (temp->rChild)
				treestack1.push(temp->rChild);
			if (temp->lChild)
				treestack1.push(temp->lChild);
			
			treestack2.pop();
		}
		res++;
		cout << endl;
	}
}

}
int main()
{
int arr[7] = { 3,9,20,-1,-1,15,7 };
TreeNode *root = create(arr, 7, 0);
ZigzagLevelOrderTraversal(root);