二叉树的建立和遍历C语言实现.doc

《二叉树的建立和遍历C语言实现.doc》由会员上传分享，免费在线阅读，更多相关内容在工程资料-天天文库。

1、#include#includetypedefstructnode{intdata;structnode*ltree;structnode*rtree;}TNode;//ADToftheBinarytreeTNode*create(TNode*);intdepth(TNode*);intfindmax(int,int);voidpostorder(TNode*);voidinorder(TNode*);voidpreorder(TNode*);intmain(){TNode*tree;printf("BinaryTree(ByRe

2、cursion)");tree=create(tree);printf("preorder:");preorder(tree);printf("inorder:");inorder(tree);printf("postorder:");postorder(tree);printf("Thedepthothebinarytreeis:%d.",depth(tree));return0;}//mainTNode*create(TNode*p){//创建一棵二叉树，返回根节点地址intnum;scanf("%d",&num);if(n

3、um==0){returnNULL;}//ifp=(TNode*)malloc(sizeof(TNode));p->data=num;//把数据赋值给数据域p->ltree=create(p->ltree);//递归算法，创建左子树p->rtree=create(p->rtree);returnp;}//createvoidpreorder(TNode*p){TNode*tree=p;if(tree){printf("%5d",p->data);preorder(p->ltree);preorder(p->rtree);}}//preordervoidinorder(

4、TNode*p){TNode*tree=p;if(tree){inorder(p->ltree);printf("%5d",p->data);inorder(p->rtree);}}//inordervoidpostorder(TNode*p){TNode*tree=p;if(tree){postorder(p->ltree);postorder(p->rtree);printf("%5d",p->data);}}//postorderintfindmax(intx,inty){return(x>y?x:y);}//findmaxintdepth(TNode*p){T

5、Node*tree=p;intdep=0;intdepl,depr;if(!p){return0;}depl=depth(p->ltree);depr=depth(p->rtree);dep=1+findmax(depl,depr);returndep;}//depth