二叉树的深度和分支节点数

点击(此处)折叠或打开

1. /*
   
2.  *二叉树采用二叉链表结构表示。设计并实现如下算法：
   
3.  *求一棵二叉树的深度和双分支结点的个数。
   
4.  */
   
5. #include <stdio.h>
   
6. #include <stdlib.h>
   
7. 
   
8. #define ERROR 0
   
9. #define OK 1
   
10. #define OVERFLOW 0
    
11. #define STACK_INIT_SIZE 100
    
12. #define STACKINCREMENT 100
    
13. 
    
14. typedef char TElemType;
    
15. typedef struct BiTNode {
    
16.     TElemType data;
    
17.     struct BiTNode *lchild, *rchild;
    
18. }BiTNode, *BiTree;
    
19. 
    
20. typedef BiTree ElemType;
    
21. typedef struct {
    
22.     ElemType *base;
    
23.     ElemType *top;
    
24.     int stacksize;
    
25. }SqStack;
    
26. 
    
27. int InitStack (SqStack *S)
    
28. {
    
29.     S->base=(ElemType *)malloc(STACK_INIT_SIZE * sizeof(ElemType));
    
30.     if (!S->base)
    
31.          exit (OVERFLOW);
    
32.     S->top=S->base;
    
33.     S->stacksize=STACK_INIT_SIZE;
    
34.     return OK;
    
35. }
    
36. 
    
37. int StackEmpty (SqStack S)
    
38. {
    
39.     if (S.base==S.top)
    
40.         return 1;
    
41.     else
    
42.         return 0;
    
43. }
    
44. 
    
45. int Push (SqStack *S, ElemType e)
    
46. {
    
47.     if (S->top - S->base >= S->stacksize)
    
48.     {
    
49.         S->base=(ElemType *)realloc(S->base,
    
50.                               (S->stacksize + STACKINCREMENT)* sizeof(ElemType));
    
51.         if (!S->base)
    
52.             exit (OVERFLOW);
    
53.         S->top=S->base+S->stacksize;
    
54.         S->stacksize+=STACKINCREMENT;
    
55.     }
    
56.     *S->top++ = e;
    
57.     return OK;
    
58. }
    
59. 
    
60. int Pop(SqStack *S,ElemType *e)
    
61. {
    
62.     if (S->top==S->base)
    
63.         return ERROR;
    
64.     *e=*(--S->top);
    
65.     return OK;
    
66. }
    
67. 
    
68. void CreateBiTree (BiTree *T)
    
69. {
    
70.     TElemType temp;
    
71.     scanf ("%c", &temp);
    
72.     if (temp==' ')
    
73.     {
    
74.         *T=NULL;
    
75.     }
    
76.     else
    
77.     {
    
78.         (*T)=(BiTree)malloc(sizeof(BiTNode));
    
79.         if (!(*T))
    
80.             exit (1);
    
81.         CreateBiTree (&((*T)->lchild));
    
82.         CreateBiTree (&((*T)->rchild));
    
83.         (*T)->data=temp;
    
84.     }
    
85. }
    
86. 
    
87. void Traverse (BiTree T)
    
88. {
    
89.     BiTree P;
    
90.     SqStack S;
    
91.     InitStack (&S);
    
92.     P=T;
    
93.     while (P||!StackEmpty(S))
    
94.     {
    
95.         if (P)
    
96.         {
    
97.             printf ("%c", P->data);
    
98.             Push(&S,P);
    
99.             P=P->lchild;
    
100.         }
     
101.         else
     
102.         {
     
103.             Pop(&S,&P);
     
104.             P=P->rchild;
     
105.         }
     
106.     }
     
107. }
     
108. 
     
109. int ComputeDeep (BiTree root)
     
110. {
     
111.     int i=0, j=0;
     
112.     if (root==NULL)
     
113.     {
     
114.         return 0;
     
115.     }
     
116.     else
     
117.     {
     
118.         i=ComputeDeep (root->lchild);
     
119.         j=ComputeDeep (root->rchild);
     
120.         return (i>j?i:j)+1;
     
121.     }
     
122. }
     
123. 
     
124. int ComputeNode (BiTree root)
     
125. {
     
126.     int i=0,j=0;
     
127.     if (root==NULL)
     
128.     {
     
129.         return i+j;
     
130.     }
     
131.     else
     
132.     {
     
133.         i=ComputeNode (root->lchild);
     
134.         j=ComputeNode (root->rchild);
     
135.         if (root->lchild&&root->rchild)
     
136.             return i+j+1;
     
137.         else
     
138.             return i+j;
     
139.     }
     
140. }
     
141. 
     
142. int main ()
     
143. {
     
144.     BiTree T;
     
145.     int deep;
     
146.     int node;
     
147.     CreateBiTree (&T);
     
148.     Traverse (T);
     
149.     printf ("\n");
     
150.     deep=ComputeDeep (T);
     
151.     printf ("deep = %d\n", deep);
     
152.     node=ComputeNode (T);
     
153.     printf ("node = %d\n", node);
     
154.     printf ("end");
     
155.     getch ();
     
156.     return 0;
     
157. }