#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
#define ERROR 0;
#define OK 1;
typedef int ElemType;
typedef struct BinaryTree
{
ElemType data;
struct BinaryTree *l;
struct BinaryTree *r;
}*BiTree,BiNode;
BiNode * new()
{
return( (BiNode *)malloc(sizeof(BiNode)) );
}
CreateSubTree(BiTree *T,ElemType *all,int i)
{
if ((all[i]==0)||i>16)
{
*T=NULL;
return OK;
}
*T=new();
if(*T==NULL) return ERROR;
(*T)->data=all[i];
CreateSubTree(&((*T)->l),all,2*i);
CreateSubTree(&((*T)->r),all,2*i+1);
}
CreateBiTree(BiTree *T)
{
ElemType all[16]={0,1,2,3,0,0,4,5,0,0,0,0,6,0,0,0,};
CreateSubTree(T,all,1);
}
printelem(ElemType d)
{
printf("%d\n",d);
}
PreOrderTraverse(BiTree T,int (*Visit)(ElemType d))
{
if(T){
if(Visit(T->data))
if(PreOrderTraverse(T->l,Visit))
if(PreOrderTraverse(T->r,Visit)) return OK;
return ERROR;
} else return OK;
}
InOrderTraverse(BiTree T,int (*Visit)(ElemType d))
{
if(T){
if(InOrderTraverse(T->l,Visit))
if(Visit(T->data))
if(InOrderTraverse(T->r,Visit)) return OK;
return ERROR;
} else return OK;
}
PostOrderTraverse(BiTree T,int (*Visit)(ElemType d))
{
if(T){
if(PostOrderTraverse(T->l,Visit))
if(PostOrderTraverse(T->r,Visit))
if(Visit(T->data)) return OK;
return ERROR;
} else return OK;
}
main()
{
BiTree root;
CreateBiTree(&root);
printf("先根次序周游\n");
PreOrderTraverse(root,printelem);
printf("对称序周游\n");
InOrderTraverse(root,printelem);
printf("后根次序周游\n");
PostOrderTraverse(root,printelem);
}
评论0