#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define N 51
typedef struct list
{
char data;
struct list *lchild, *rchild;
}list;
int n; int i = -1, c = 0;
char a[N];
list *creat()
{
list *T;
i++;
if (a[i] != ',')
{
T = (list*)malloc(sizeof(list));
T->data = a[i];
T->lchild = creat();
T->rchild = creat();
return T;
}
else
{
return NULL;
}
}
void count(list *T, int *c)
{
if (T != NULL)
{
if (T->lchild == NULL&&T->rchild == NULL)
(*c)++;
//printf("%d\n", c);
count(T->lchild, c);
count(T->rchild, c);
}
}
int main()
{
list *T;
while (gets(a) != NULL)
{
i = -1;
c = 0;
n = strlen(a);
T = creat();//建立二叉树
count(T, &c);
printf("%d\n", c);
}
}
Problem Description
已知二叉树的一个按先序遍历输入的字符序列,如abc,,de,g,,f,,, (其中,表示空结点)。请建立二叉树并求二叉树的叶子结点个数。
Input
连续输入多组数据,每组数据输入一个长度小于50个字符的字符串。
Output
输出二叉树的叶子结点个数。
Example Input
abc,,de,g,,f,,,
Example Output
3
Hint
Author
xam
#include#include#include#define N 51typedef struct list{ char data; struct list *lchild, *rchild;}list;int n; int i = -1, c = 0;char a[N];list *creat(){ list *T; i++; if (a[i] != ',')