6.42.c

数据结构习题及答案

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

要求实现下列函数：
void Leaves(BiTree bt, int &x);
/* Count the leaf node of the BiTree */
/* whose root node is bt to x.       */

二叉链表类型定义：
typedef struct BiTNode {
    TElemType data;
    BiTNode  *lchild, *rchild;
} BiTNode, *BiTree;
void Leaves(BiTree bt, int &x)
/* Count the leaf node of the BiTree */
/* whose root node is bt to x.       */
{   int x0,x1;
    if(!bt) x=0;
    else if(!bt->rchild&&!bt->lchild) x=1;
    else {
          Leaves(bt->rchild,x0);
          Leaves(bt->lchild,x1);
          x=x0+x1;
           }
}