数据结构实验之二叉树三：统计叶子数

#include<stdio.h>
#include<string.h>
typedef struct tree
{
char data;
struct tree *l,*r;
}tree;
int i;
char s[55];
tree *newtree()
{
tree *t;
t = (tree *)malloc(sizeof(tree));
t -> l = t -> r = NULL;
return t;
}
tree *creat()
{
tree *t = newtree();
if(s[i++] == ‘,’) return NULL;
t -> data = s[i-1];
t -> l = creat();
t -> r = creat();
return t;
}
int leave(tree *t)
{
if(t == NULL) return 0;
if(t -> l == NULL && t -> r == NULL) return 1;
else return leave(t -> l) + leave(t -> r);
}
int main()
{
int k;
tree *t;
while(scanf("%s",s)!= EOF)
{
i = 0;
t = creat();
k = leave(t);
printf("%d\n",k);
}
return 0;
}