以二叉链表作存储结构,试编程实现前序、中序、后序及层次顺序遍历二叉树的算法。

else
return (OK);
}
int InOrderTraverse(BiTree T) //InOrderTraverse sub-function
{ if(T)
{ if (InOrderTraverse(T->lchild)) //traverse lchild
{ TElemType data;
struct BiTNode *lchild,*rchild;
}BiTNode, *BiTree;
int BiTreeEmpty(BiTree T)
{
if(T == NULL)
return 0;
else
return 1;
}
cout<<endl;
printf("层序遍历为：");
LevleOrder(T);
cout<<endl;
DestoryBiTree(T);
return 0;
}
return (OK);
} //PostOrderTraverse() end
void LevleOrder(BiTree T){
BiTree Queue[max],p;
int front=0,rear=0;
if(T)
{Queue[rear++]=T;
while(front!=rear){
if(PostOrderTraverse(T->rchild)) //traverse rchild
{ cout<<T->data<<"->"; //visite T
return (OK);
}
return (ERROR);
}
else
p=Queue[front++];
printf("%c->",p->data);
if(p->lchild!=NULL)
Queue[rear++]=p->lchild;
if(p->rchild!=NULL)
Queue[rear++]=p->rchild;}
}
}
void DestoryBiTree(BiTree &T)
{ cout<<T->data<<"->"; //visite T
if(InOrderTraverse(T->rchild)) //traverse rchild
retur);
} //if end
/*建立二叉树*/
int CreateBiTree(BiTree &T) //createBiTree() sub-function
{ TElemType ch;
cin>>ch;
if(ch=='/') T=NULL;
else
{ if(!(T=(BiTNode *)malloc(sizeof(BiTNode))))
else
return (OK);
} //InOrderTraverse() end
int PostOrderTraverse(BiTree T) //PostOrderTraverse() sub-function
{ if(T)
{ if (PostOrderTraverse(T->lchild)) //traverse lchild
#include<iostream.h>
#include<stdio.h>
#include<stdlib.h>
#define OK 1
#define ERROR 0
#define max 100
typedef char TElemType;
/* 二叉树节点的存储类型 */
typedef struct BiTNode //define stricture BiTree
}
return (OK);
} //CreateBiTree() end
/*前序遍历二叉树的递归算法*/
int PreOrderTraverse(BiTree T) //PreOrderTravers sub-function
{ if(T)
{ cout<<T->data<<"->"; //visite T
{
if(BiTreeEmpty(T))
{
DestoryBiTree(T->lchild);
DestoryBiTree(T->rchild);
free(T);
}
}
int main(){
printf("-------------------------------\n");
{ cout<<"Overflow!"; //no alloction
return (ERROR);
}
T->data=ch;
CreateBiTree(T->lchild); //create lchild
CreateBiTree(T->rchild); //create rchild
CreateBiTree(T);
printf("先序遍历为：");
PreOrderTraverse(T);
cout<<endl;
printf("中序遍历为：");
InOrderTraverse(T);
cout<<endl;
printf("后序遍历为：");
PostOrderTraverse(T);
printf("董文来：实验一(1)\n");
printf("-------------------------------\n");
printf("----------二叉链表作存储结构---------\n");
BiTree T;
printf("请输入初始二叉树(按先序)：");
if (PreOrderTraverse(T->lchild)) //traverse lchild
if (PreOrderTraverse(T->rchild)) //traverse rchild
return (OK);
return (ERROR);
} //if end