求二叉树叶子节点数

#include<stdio.h>#include<stdlib.h>typedef struct BTNode{    struct BTNode *lchild,*rchild;    int data;}BTNode,*btnode;void createBtree(btnode &T){    int t;    scanf("%d",&t);    if(t==0)        T=NULL;    else    {        T=(btnode)malloc(sizeof(BTNode));        T->data=t;        createBtree(T->lchild);        createBtree(T->rchild);    }}int n=0;void count(btnode T){    if(T)    {        if(T->lchild==NULL&&T->rchild==NULL)        n++;        count(T->lchild);        count(T->rchild);    }}void main(){    int s;    btnode T;    createBtree(T);    count(T);    printf("leaves=%d\n",n);}