求二叉树叶子结点的个数

#include<iostream>
#define N 63


using namespace std;


char str[] = "ab#d##c#e##";
int i = -1;


typedef struct node
{
char data;
struct node *leftChild;
struct node *rightChild;


}BiTreeNode,*BiTree;


//生成一个节点


BiTreeNode *createNode(int i)
{
BiTreeNode* q = new BiTreeNode;
q->leftChild = NULL;
q->rightChild = NULL;
q->data = i;


return q;
}


BiTree createBiTree1()
{
BiTreeNode *p