非递归实现前序、中序、后序遍历二叉树

最新推荐文章于 2025-08-23 16:01:06 发布

weixin_34185512

最新推荐文章于 2025-08-23 16:01:06 发布

阅读量49

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法 python

原文链接：https://my.oschina.net/liangxiao/blog/157246

本文详细介绍了二叉树的三种遍历方式：前序遍历、中序遍历和后序遍历。通过具体的代码实现，帮助读者理解每种遍历的特点及应用场景。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

2019独角兽企业重金招聘Python工程师标准>>>

// test2.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include<iostream>
#include<stack>
using namespace std;

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

void PreTraverseTree(ListNode *root)
{
	if(root == NULL)
		return;
	stack<ListNode *> stack;
	ListNode *p = root;
	stack.push(p);	
	while(!stack.empty())
	{
		while(p)
		{
			stack.push(p);
			cout<<p->val<<"  ";
			p = p->left;
		}
		 p = stack.top();
		 stack.pop();
		 p = p->right;		
	}
}


void InTraverseTree(ListNode * root)
{
	if(root == NULL)
		return;
	stack<ListNode *> stack;
	ListNode *p = root;	
	while(p || !stack.empty())
	{	
		
		while(p)
		{
			stack.push(p);
			p = p->left;
		}
		p = stack.top();
		stack.pop();
		cout<<p->val<<" ";
		p = p->right;
	}
}

void PostTraverseTree(ListNode *root)
{
	if(root == NULL)
		return ;
	stack<ListNode*> stack;
	int flag[20];
	ListNode *p = root;
	while(p)
	{
		stack.push(p);
		flag[stack.size()] = 0;
		p = p->left;
	}
	
	while(!stack.empty())
	{
		p = stack.top();
		while(p->right && flag[stack.size()] == 0)
		{
	    	p = p->right;
			flag[stack.size()] = 1;
	    	while(p)
			{
		    	stack.push(p);
		      	flag[stack.size()] = 0;
		    	p = p->left;
			}
			p = stack.top();
		}
    	p = stack.top();		
	    cout<<p->val<<"   ";
	    stack.pop();
	}

}

int main(int argc, char* argv[])
{
	ListNode * root = new ListNode(10);
	root->left = new ListNode (5);
	root->right = new ListNode(11);
	root->left->right = new ListNode(6);

	cout<<"PreOrderTraverseTree:";
	PreTraverseTree(root);
	cout<<endl;
	cout<<"InOrerTraverseTree:";
	InTraverseTree(root);
	cout<<endl;
	cout<<"PostOrderTraverseTree:";
	PostTraverseTree(root);


	return 0;
}

转载于:https://my.oschina.net/liangxiao/blog/157246