二叉树叶子节点个数

在这里插入代码片
#include "stdio.h"
#include "malloc.h"
typedef struct node{
	char data;
	struct node *lchild,*rchild;
}Tree ,*btree;
void creat(btree *t){
	char a;
	scanf("%c",&a);
	if(a==' '){
		*t=NULL;
	}else{
		*t=(btree)malloc(sizeof(btree));
		(*t)->data=a;
		creat(&((*t)->lchild));
		creat(&((*t)->rchild));
	}
}

//先序遍历：根节点，左子树，右子树 
void display(btree t,int len){
	if(t){
		printf("%c位于第%d层\n",t->data,len);
		qian(t->lchild,len+1);
		qian(t->rchild,len+1);
	}
}


//二叉树叶子节点个数
int leaf=0;
int leafnum(btree t){
	if(t){
		leafnum(t->lchild);//一直递归到左子树为空
		leafnum(t->rchild);
		if(t->lchild==NULL&&t->rchild==NULL){
			leaf++;
		}
	}
	return leaf;
}
int main(){
	btree t=NULL,t1;
	int len=1,ln;
	creat(&t);
	printf("二叉树：\n");
	printf("输出：\n");
	display(t,len);
	printf("\n");
	ln=leafnum(t);
	printf("二叉树叶子节点个数：%d\n",ln);
	printf("\n");
	return 0;
}