2021-11-07二叉树的叶节点

#include <bits/stdc++.h>
using namespace std;

typedef struct btnode
{
    char data;
    struct btnode *lchild,*rchild;
}btnode,*btree;
void buildtree(btree &t)
{
    char ch=getchar();
    if(ch=='@')
    t=NULL;
    else
    {
        t=new btnode;
        t->data=ch;
        buildtree(t->lchild);
        buildtree(t->rchild);
    }
}
int Leaf(btree T)
{
	if(T==NULL)
		return 0;
    if(T->lchild==NULL)
        return 1+Leaf(T->rchild);
    else
        return Leaf(T->lchild)+Leaf(T->rchild);
}
int main()
{
    btree t;
    buildtree(t);
    printf("%d\n",Leaf(t));
    return 0;
}
/*ABD@F@@@CE@@@*/