二叉树的应用（1）--二叉树排序树基本操作(二)
败\n中序遍历为:\n",key); InOrderTravseBST(T); printf("\n"); //测试4 删除 根节点 key = 10; if(DeleteBSTNode(T,key)) { printf("删除key = %d 节点成功\n",key); }else printf("删除key = %d 节点失败\n",key); printf("中序遍历为：\n"); InOrderTravseBST(T); printf("\n"); //测试5 删除 只有右子树 key = 2; if(DeleteBSTNode(T,key)) { printf("删除key = %d 节点成功\n",key); }else printf("删除key = %d 节点失败\n",key); printf("中序遍历为：\n"); InOrderTravseBST(T); printf("\n"); //测试6 删除 只有左子树 key = 9; if(DeleteBSTNode(T,key)) { printf("删除key = %d 节点成功\n",key); }else printf("删除key = %d 节点失败\n",key); printf("中序遍历为：\n"); InOrderTravseBST(T); printf("\n"); //测试7 删除 叶子节点 key = 78; if(DeleteBSTNode(T,key)) { printf("删除key = %d 节点成功\n",key); }else printf("删除key = %d 节点失败\n",key); printf("中序遍历为：\n"); InOrderTravseBST(T); printf("\n"); } int main() { Test(); return 0; }