编写递归算法，计算二叉树中叶子结点的数目。?

Question

编写递归算法，计算二叉树中叶子结点的数目。

Answer 1

Leaf_Num(BTnode *BT)
{
if(BT==NULL) return 0;
if(BT->left==NULL && BT->right==NULL) return 1;
else return Leaf_Num(BT->left)+Leaf_Num(BT->right);
}