數據結構——二叉樹習題（二）

1.建立二叉樹 BTreeNode * CreateNode(int data) { BTreeNode *node = (BTreeNode *)malloc(sizeof(BTreeNode)); node->data = data; node->left = node->right = NULL; return node; } BTreeNode* CreateTree(i

>>阅读原文<<