说明: 运行会中断,请求前辈修改,谢谢! void main(){ CTreeNode Tr,*Tree=&Tr; BTreeNode Bt,*BTree=&Bt; printf("创建的树\n"); Tree=createSTree(); printf("树的先序遍历结果为:\n"); preorderTree(Tree); printf("\n"); printf("树的后序遍历结果:\n"); postorderTree(Tree); printf("\n"); TreeToBTree(Tree
<yanghelang> 上传 | 大小:5kb