void f1(TNode *t)
{
TNode *stack[100];
int top=-1;
stack[++top]=t;
while(top!=-1)
{
TNode *q=stack[top--];
print(q);
if(q->rchild!=NULL)
{
stack[++top]=q->rchild;
}
if(q->lchild!=NULL)
{
stack[++top]=q->lchild;
}
}
}
#include<iostream>
using namespace std;
typedef struct BTNode
{
int data;
struct BTNode *lchild,*rchild;
}BTNode;
void create(BTNode *&bt)
{
int data;
cin >> data;
if(data==0)
bt=NULL;
else
{
bt=new BTNode();
bt->data=data;
create(bt->lchild);
create(bt->rchild);
}
}
void preOrder(BTNode *bt)
{
if(bt==NULL)
return;
BTNode *Stack[100]; int top=-1;
Stack[++top]=bt;
while(top!=-1)
{
BTNode *p=Stack[top--];
cout << p->data << endl;
if(p->rchild!=NULL)
Stack[++top]=p->rchild;
if(p->lchild!=NULL)
Stack[++top]=p->lchild;
}
}
void midOrder(BTNode *bt)
{
if(bt==NULL)
return;
BTNode *Stack[100]; int top=-1;
BTNode *p=bt;
while(top!=-1||p!=NULL)
{
while(p!=NULL)
{
Stack[++top]=p;
p=p->lchild;
}
if(top!=-1)
{
p=Stack[top--];
cout << p->data << endl;
p=p->rchild;
}
}
}
void endOrder(BTNode *bt)
{
if(bt==NULL)
return;
BTNode *Stack[100]; int top=-1;
BTNode *Stack2[100]; int top2=-1;
Stack[++top]=bt;
while(top!=-1)
{
BTNode *p=Stack[top--];
Stack2[++top2]=p;
if(p->lchild!=NULL)
Stack[++top]=p->lchild;
if(p->rchild!=NULL)
Stack[++top]=p->rchild;
}
while(top2!=-1)
{
cout << Stack2[top2--]->data << endl;
}
}
int main()
{
BTNode *bt;
create(bt);
cout << "非递归先序遍历" << endl;
preOrder(bt);
cout << "非递归中序遍历" << endl;
midOrder(bt);
cout << "非递归后序遍历" << endl;
endOrder(bt);
return 0;
}