二叉树的各种遍历方法中,非递归的遍历要比递归遍历更加复杂一些,但是听说在面试中也更容易考到。如果有什么不理解的地方,自己画下图然后结合上代码很容易理解的。
#include <iostream>
using namespace std;
#include <cstdio>
#include <cstring>
#include <malloc.h>
#include <queue>
#include <stack>
typedef struct node
{
struct node *lchild;
struct node *rchild;
char data;
}Node, *BinNode;
int Create(BinNode &root) //输入节点信息
{
char ch = '\0';
scanf("%c", &ch);
getchar();
if(ch == ' ') root = NULL;
else
{
if(!(root = (BinNode)malloc(sizeof(Node)))) exit(0);
root->data = ch;
Create(root->lchild);
Create(root->rchild);
}
return 1;
}
void PreOrder(BinNode root) //先序非递归遍历
{
stack<BinNode>s;
BinNode p = root;
while(p!=NULL || !s.empty())
{
while(p!=NULL) //将左子树入栈,然后输出结点信息
{
cout<<p->data<<endl;
s.push(p);
p = p->lchild;
}
if(!s.empty()) //如果栈不为空,那么遍历右子树
{
p = s.top();
s.pop();
p = p->rchild;
}
}
}
void InOrder(BinNode root) //中序非递归遍历,和先序非递归遍历类似,只是输出的位置不一样而已
{
stack<BinNode>s;
BinNode p = root;
while(p!=NULL || !s.empty())
{
while(p!=NULL)
{
s.push(p);
p = p->lchild;
}
if(!s.empty())
{
p = s.top();
cout<<p->data<<endl;
s.pop();
p = p->rchild;
}
}
}
void LastOrder(BinNode root) //后序非递归遍历(这个最复杂)
{
stack<BinNode>s;
BinNode p = root;
BinNode pre = NULL; //记录前一个访问的点
while(p != NULL || !s.empty())
{
while(p != NULL) //把左子树全部入栈
{
s.push(p);
p = p->lchild;
}
p = s.top();
if(p->rchild == NULL || p->rchild == pre) //如果该点的右子树为空或者已经访问了,那该点就允许访问
{
cout<<p->data<<endl;
s.pop();
pre = p;
p = NULL; //将p设成NULL,防止下次循环重复压栈
}
else
{
p = p->rchild; //否则遍历右子树
}
}
}
void CengCiOrder(BinNode root) //层次非递归遍历
{
queue<BinNode >q;
q.push(root);
while(!q.empty())
{
BinNode temp = q.front();
cout<<temp->data<<" ";
q.pop();
if(temp->lchild != NULL)
q.push(temp->lchild);
if(temp->rchild != NULL)
q.push(temp->rchild);
}
}
int main()
{
BinNode root = NULL;
Create(root);
cout<<"先序遍历:";
PreOrder(root);
cout<<endl<<"中序遍历:";
InOrder(root);
cout<<endl<<"后序遍历:";
LastOrder(root);
cout<<endl<<"层次遍历:";
CengCiOrder(root);
cout<<endl;
return 0;
}