数据结构(C)实验精典源程序

#include"binaryTree.h" Status visit(ElemType e){ #ifdef CHAR printf("%c ",e); #endif #ifdef INT printf("%d ",e); #endif return OK; } void main(){ Tree T,p; ElemType e,eother; initTree(&T); printf("Is the Tree empty? %d(1-Yes;0-No).\n",treeEmpty(T)); printf("It's depth is %d\n",treeDepth(T)); e=root(T); if(e!=null) #ifdef CHAR printf("It's root is: %c\n",e); #endif #ifdef INT printf("It's root is: %d\n",e); #endif else printf("It is empty and has no root!\n"); /*创建*/ #ifdef CHAR printf("CHAR---Input preOrder like: ab c \n"); #endif #ifdef INT printf("INT----Input preOrder like: 1 2 0 0 3 0 0\n"); #endif createTree(&T); printf("Is it empty? %d(1-Yes,0-No)",treeEmpty(T)); printf("It's depth is %d\n",treeDepth(T)); e=root(T); if(e!=null) #ifdef CHAR printf("It's root is: %c\n",e); #endif #ifdef INT printf("It's root is: %d\n",e); #endif else printf("It is empty and has no root!\n"); /*遍历*/ printf("preorderTraverse: "); preorderTraverse(T,visit); printf("\ninorderTraverse: "); inorderTraverse(T,visit); printf("\nmyinorderTraverse: "); myinorderTraverse(T,visit); printf("\notherinorderTraverse: "); otherinorderTraverse(T,visit); printf("\npostorderTraverse: "); postorderTraverse(T,visit); printf("\nlevelorderTraverse: "); levelorderTraverse(T,visit); printf("\nChoose one point: "); #ifdef CHAR /* 运算符*表示该输入项读入后不赋予相应的变量，即跳过该输入值 */ /*可替换为 getchar(); */ /* scanf("%c",&e); */ scanf("%*c%c",&e); #endif #ifdef INT scanf("%d",&e); #endif /*显示*/ p=point(T,e); #ifdef CHAR printf("Its value is: %c\n",value(p)); #endif #ifdef INT printf("Its value is: %d\n",value(p)); #endif /*改变*/ printf("Change its value as: "); #ifdef CHAR /*可替换为 getchar(); */ /* scanf("%c",&eother); */ /* getchar(); */ scanf("%*c%c%*c",&eother); #endif #ifdef INT scanf("%d",&eother); #endif /*遍历*/ assign(p,eother); printf("Now the tree is:\n"); printf("preorderTraverse: "); preorderTraverse(T,visit); printf("\ninorderTraverse: "); inorderTraverse(T,visit); printf("\npostorderTraverse: "); postorderTraverse(T,visit); printf("\nlevelorderTraverse: "); levelorderTraverse(T,visit); destroyTree(&T); }