数据结构实验之二叉树三:统计叶子数 #include<iostream>
#include<stdlib.h>
#include<stdio.h>
using namespace std;
struct node
{
char data;
struct node *l,*r;
};
int count,sum;
char a[1010];
struct node *creat()
{
struct node *root;
root=(struct node *)malloc(sizeof(struct node ));
if(a[count++]==',')
root=NULL;
else
{
root->data=a[count-1];
root->l=creat();
root->r=creat();
}
return root;
};
int Countleaf(struct node *root)
{
if(root)
{
if(root->l==NULL&&root->r==NULL)
sum++;
Countleaf(root->l);
Countleaf(root->r);
}
return sum;
}
int main()
{
int n;
struct node *root;
while(~scanf("%s",a))
{
count=0;
sum=0;
root=creat();
n=Countleaf(root);
cout<<n<<endl;
}
return 0;
}
#include<iostream>
#include<stdlib.h>
#include<stdio.h>
using namespace std;
struct node
{
char data;
struct node *l,*r;
};
int count,sum;
char a[1010];
struct node *creat()
{
struct node *root;
root=(struct node *)malloc(sizeof(struct node ));
if(a[count++]==',')
root=NULL;
else
{
root->data=a[count-1];
root->l=creat();
root->r=creat();
}
return root;
};
int Countleaf(struct node *root)
{
if(root)
{
if(root->l==NULL&&root->r==NULL)
sum++;
Countleaf(root->l);
Countleaf(root->r);
}
return sum;
}
int main()
{
int n;
struct node *root;
while(~scanf("%s",a))
{
count=0;
sum=0;
root=creat();
n=Countleaf(root);
cout<<n<<endl;
}
return 0;
}
Time Limit: 1000MS Memory Limit: 65536KB
Problem Description
已知二叉树的一个按先序遍历输入的字符序列,如abc,,de,g,,f,,, (其中,表示空结点)。请建立二叉树并求二叉树的叶子结点个数。
Input
连续输入多组数据,每组数据输入一个长度小于50个字符的字符串。
Output
输出二叉树的叶子结点个数。
Example Input
abc,,de,g,,f,,,
Example Output
3