当二叉树的结点都没有左右孩子时,称之为叶子结点。采用递归方法计算叶子结点。
// 计算叶子结点数
void caculateLeafNum(BinaryTree * root, int *leafNum)
{
if(root ==NULL)
return;
if(root->pLeft ==NULL&&root->pRight ==NULL)
{
(*leafNum)++;
}
caculateLeafNum(root->pLeft,leafNum);
caculateLeafNum(root->pRight,leafNum);
}