int bt_node_count(btree tree) {
int num1, num2;
if (tree == NULL) {
return 0;
} else {
num1 = bt_node_count(tree->lchild);
num2 = bt_node_count(tree->rchild);
return (num1 + num2 + 1);
}
}
int num1, num2;
if (tree == NULL) {
return 0;
} else {
num1 = bt_node_count(tree->lchild);
num2 = bt_node_count(tree->rchild);
return (num1 + num2 + 1);
}
}
转载于:https://blog.51cto.com/wujuxiang/421975