题目：

代码：

#include<iostream>
using namespace std;
typedef struct BinaryTree
{
	char data;
	struct BinaryTree* left;
	struct BinaryTree* right;
}BT;
void BinaryTreeCreate(BT*& ps)//二叉树创建
{
	char a;
	cin >> a;
	if (a == '#')
		ps = NULL;
	else
	{
		ps = (BT*)malloc(sizeof(BT));
		ps->data = a;
		BinaryTreeCreate(ps->left);
		BinaryTreeCreate(ps->right);
	}
}
//求叶子结点个数
int BinaryTreeLeafSize(BT* ps)
{
	if (ps == NULL)
		return 0;
	if (ps->left == NULL && ps->right == NULL)//左右子树都为空时返回1
		return 1;
	return BinaryTreeLeafSize(ps->left) + BinaryTreeLeafSize(ps->right);
}
int main()
{
	BT* tree;
	BinaryTreeCreate(tree);
	printf("%d", BinaryTreeLeafSize(tree));
	return 0;
}