数据结构树的相关操作.doc

/*递归方法相关操作*/ #includestdio.h #define maxsize 100 #include malloc.h typedef char datatype; typedef struct node { datatype data; struct node *lchild,*rchild; }bitree; /*建立*/ bitree *Q[maxsize]; bitree *creatree() { char ch; int front,rear; bitree *root,*s; root=NULL; front=1; rear=0; ch=getchar(); while(ch!=#) { s=NULL; if(ch!=@) { s=malloc(sizeof(bitree)); s-data=ch; s-lchild=NULL; s-rchild=NULL; } rear++; Q[rear]=s; if(rear==1) root=s; else { if(sQ[front]) if(rear%2==0) Q[front]-lchild=s; else Q[front]-rchild=s; if(rear%2==1) front++; } ch=getchar(); } return root; } /*前序遍历*/ void preorder(bitree *t) { if(t) { printf(%c,t-data); preorder(t-lchild); preorder(t-rchild); } } /*中序遍历*/ void inorder(bitree *t) { if(t) { inorder(t-lchild); printf(%c,t-data); inorder(t-rchild); } } /*后序遍历*/ void postorder(bitree *t) { if(t) { postorder(t-lchild); postorder(t-rchild); printf(%c,t-data); } } void main() { bitree *t; printf(Please input your tree:\n); t=creatree(); printf(\n); printf(preorder:); preorder(t); printf(\n\n); printf(inorder:); inorder(t); printf(\n\n); printf(postorder:); postorder(t); getch(); } 运行结果：