PTA第六章树答案参考

int LeafCount(BiTree T) {
    if (T == NULL) {
        return 0;
    }
    if (T->lchild == NULL && T->rchild == NULL) {
        return 1;
    }
    return LeafCount(T->lchild) + LeafCount(T->rchild);
}

int Depth(BiTree T) {
    if (T == NULL) {
        return 0;
    }
    int leftDepth = Depth(T->lchild);
    int rightDepth = Depth(T->rchild);
    return (leftDepth > rightDepth ? leftDepth : rightDepth) + 1;
}