《二叉排序树 求树的深度 各个结点的深度》由会员分享，可在线阅读，更多相关《二叉排序树 求树的深度 各个结点的深度（4页珍藏版）》请在金锄头文库上搜索。
1、#include #include tvpedef stmct Treeiiit data;stmct Tree *left;stmct Tree *right;*tree;void InseilTree(tree p.int num)tree T; T = p; iiit i; int sign;i=0; tree q.tmp;q =(tree ) malloc( sizeof(struct Tree);q-data = num; q-left =NULL; q-right =NULL:while(T)fiif(num T-data ) tmp = T; T= T-right;sign =!
2、;else tmp = T; T= T-left; sign =0;if(T =NULL & sign = 1) tmp -iight = q;if(T =NULL & sign = 0) tmp -left = q;mt TreeDepth(tree p) 统计”根“的深度tree T = p; iiit i; tree q100; i =1; q0= T;int k; k = 0;int rs100;iiit ls100; iiit j; int num =1; int max=l;血(J=0； jleft & lsi = 0)T =T-left; Is 1 = 1; /访问了 彳前结点的
3、左结点、,则标记Ls i=l;i+； qi = T;k+;lsi =0; rsi = 0; 每次进栈的新结点，其左子树和右子树均为访问num卄；if(niax left =NULL & T-iight & isi =0 ) | (lsi =1 & T-right& isi =0 )T = T-right; rsi =1; /访问了当前结点的右结点,则标记Rsi=1;k+; i+; qi = T;lsi =0; rsi = 0;num卄;ifmax left =NULL & rsi = 1 ) |(T-left NULL & T-nght = NULL) |(T-right =NULL & ls
4、i = 1 ) |( rsi =1& lsi = 1 )1; k+; num;T = qi；retiiin max; void AUTreeDepth(treep)/所有“结点”的深度,利用“每个结点“重新作为”根J重 复运用”求根的深度“函数则可tree T = p; int i; tree q100; i =1; q0= T;int k; k = 0;int rs100:mt ls100; mtj;血(J=0； jdata,TreeDepth(qi);while(T-left & lsi = 0)T =T-left;lsi= 1;i+； qi = T;k+;lsi =0; rsi = 0;
5、pnntf(”结点值为d 的深度:%dnM,qi-data,TieeDepth(qi);if( T-left =NULL & T-right & rsi =0 ) | (lsi =1 & T-right& rsi=0)T = T-nght;rsi =1; k+;i+;qi = T;lsi =0; rsi = 0;prmtf(结点值为d 的深度:%dn,qi-data,TreeDepth(qi);if( (T-left =NULL & rsi = 1 ) |(T-left =NULL & T-nght = NULL)|(T-nght =NULL& lsi = 1 ) |(isi =1& lsi = 1)T = qi；void main()tree p =NULL; iiit num; scanf(,%d,&ui】m);p =(tree) nialloc( siz亡obstruct Tree);p-data = num; p-left =NULL; p-right =NULL;mt i;for(i=l; i=4;i+)scanf(H%d,&ni】m); IiiseitTree(p4ium);pnntf(MnM);printfC树的深度为:%dnH,TreeDepth(p);AllTreeDepth(p); pnntf(MnM);
