求叶子节点个数

#include<stdio.h>
#include<stdlib.h>
typedef struct Bitnode
{
	char data;
	struct Bitnode* lchild, * rchild;
}Bitnode, * Bitree;
void PreOrd(Bitree T)
{
	if (T == NULL)
		return;
	printf("%c", T->data);
	PreOrd(T->lchild);
	PreOrd(T->rchild);
}
void InOrderTraverse(Bitree T)//二叉树的中序遍历
{
	if (T == NULL)
		return;
	InOrderTraverse(T->lchild);
	printf("%c", T->data);
	InOrderTraverse(T->rchild);
}
int countleaf(Bitree* T, int count)
{
	if ((*T) != NULL)
	{
		if ((*T)->lchild == NULL && (*T)->rchild == NULL)
		{
			count++;
		}
		count = countleaf(&(*T)->lchild, count);
		count = countleaf(&(*T)->rchild, count);
	}
	return count;
}
void create(Bitree* T)
{
	char ch;
	scanf_s("%c", &ch);
	if (ch == '#')
		*T = NULL;
	else {
		*T = (Bitree)malloc(sizeof(Bitnode));
		if (!*T)
			exit(0);
		(*T)->data = ch;
		create(&(*T)->lchild);
		create(&(*T)->rchild);

	}
}
int main()
{
	Bitree T;
	printf_s("输入字符串序列：\n");
	int count = 0;
	create(&T);
	printf_s("输出序列为：\n");
	InOrderTraverse(T);
	printf_s("叶子节点数为：");
	count = countleaf(&T, count);
	printf("\n%d", count);
	return 0;
}


  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
  
27
  
28
  
29
  
30
  
31
  
32
  
33
  
34
  
35
  
36
  
37
  
38
  
39
  
40
  
41
  
42
  
43
  
44
  
45
  
46
  
47
  
48
  
49
  
50
  
51
  
52
  
53
  
54
  
55
  
56
  
57
  
58
  
59
  
60
  
61
  
62
  
63
  
64
  
65
  
66
 

文章来源: chuanchuan.blog.csdn.net，作者：川川菜鸟，版权归原作者所有，如需转载，请联系作者。

原文链接：chuanchuan.blog.csdn.net/article/details/118554839