//二叉树的清空操作 SearchTree MakeEmptyTree(SearchTree tree) { if (tree != NULL) { MakeEmptyTree(tree->left); MakeEmptyTree(tree->right); free(tree); } return NULL; }
bsptree_t *BuildTree() { bspline_t *lines = MakeLineList(); bsptree_t *tree = MakeEmptyTree(); BuildTreeRecursive(tree, tree->root, lines); return tree; }