Description
已知二叉树的一个按先序遍历输入的字符序列,如abc,de,g,f, (其中,表示空结点)。请建立二叉树并求二叉树的叶子结点个数。
Input
连续输入多组数据,每组数据输入一个长度小于50个字符的字符串。
Output
输出二叉树的叶子结点个数。
Sample
Input
abc,de,g,f,
Output
3
#include <stdio.h>
#include <stdlib.h>
char a[100];
int x;
struct node
{
int data;
struct node *l, *r;
};
struct node *creat()
{
struct node *tree;
char c;
c = a[x++];
if (c==',')
return NULL;
else
{
tree = (struct node *)malloc(sizeof(struct node));
tree->data = c;
tree->l = creat();
tree->r = creat();
}
return tree;
};
int leave(struct node *tree)
{
if (tree==NULL) return 0;
if (tree->l==NULL&&tree->r==NULL) return 1;
else return leave(tree->l)+leave(tree->r);
}
int main()
{
int k;
while (~scanf("%s", a))
{
x = 0;
struct node *tree;
tree = (struct node *)malloc(sizeof(struct node));
tree = creat();
k = leave(tree);
printf("%d\n", k);
}
return 0;
}