实验二排序二叉树的建立、查找、遍历、结点删除

1、/*/*实验二排序二叉树的建立、查找、遍历、结点删除*/*/#include#include#includestruct tree char info; struct tree *left,*right; ;struct tree *create_btree(struct tree *root,struct tree *r,char info);struct tree *search_btree(struct tree *root,char key);struct tree *delete_node(struct tree *root,char key);void print_btree(st

2、ruct tree *r,int l);void preorder(struct tree *t); /先序递归遍历二叉树void inorder(struct tree *t); /中序递归遍历二叉树void postorder(struct tree *t); void main() char s100, c, e; struct tree *root=0, *p; printf(input a letter for creating the binary_tree ( directly press to stop ):n); do printf(ninput a letter: ); e

3、=_getch();_putch(e);if(e=13) break;if (!root)root=create_btree(root,root,e);elsecreate_btree(root,root,e);/gets(s);/if(s0=0) break;/if (!root)/root=create_btree(root,root,*s);/else/create_btree(root,root,*s); while (*s) ;printf(n先序遍历结果：);preorder(root); /先序递归遍历二叉树printf(n中序遍历结果：);inorder(root); prin

4、tf(n后序遍历结果：); /中序递归遍历二叉树postorder(root); printf(n);while ( c!=!) /查找print_btree(root,0);printf(enter a character to find( ! to stop ):);scanf(%s,&c);printf(n);p=search_btree(root,c); printf(n);c=1;while ( c!=!) /删除节点print_btree(root,0);printf(enter a character to delete( ! to stop ):);scanf(%s,&c);p

5、rintf(n);root=delete_node(root,c); /删除结点后返回树的根 printf(n); /* btree.c 结束 */ struct tree *create_btree(struct tree *root,struct tree *r,char info) if (r =0 ) r=new (struct tree);if ( r = 0) printf(out of memoryn); return 0 ; r-left= 0; r-right=0; r-info=info;if (root) if(infoinfo) root - left=r;else r

6、oot-right=r;else r-right=0; r-left = 0; return r; if (info info)create_btree(r,r-left,info);if(info=r-info)create_btree(r,r-right,info);return root; /* create_btree(root,r,info) */void preorder(struct tree *t) if(t) printf(%c,t-info); /访问结点 preorder(t-left); /遍历左子树 preorder(t-right); /遍历右子树 void inorder(struct tree *t)if(t) inorder(t-left); /遍历左子树 printf(%c,t-info); /访问结点 inorder(t-right); /遍历右子树 void postorder(