二叉链表和二叉树的区别 以二叉链表为存储结构？
以二叉链表为存储结构？int CountNode (BTNode *t) //节点总数 { int num if (t == NULL) num = 0 else num = 1 CountNod
以二叉链表为存储结构？
int CountNode (BTNode *t) //节点总数 { int num if (t == NULL) num = 0 else num = 1 CountNode (t->lch) CountNode (t->rch) return (num) } void CountLeaf (BTNode *t) //叶子节点总数 { if (t != NULL) { if (t->lch == NULL && t->rch == NULL) count // 全局变量 CountLeaf (t->lch) CountLeaf (t->rch) } }