之前问的有点不清楚,现在修改一下。有问题的一行注释了
BinTree Delete( BinTree BST, ElementType X )
{ Position pl,temp;
if(!BST) printf("Not Found\n");
else{
if(XData)
BST->Left = Delete(BST->Left,X);
else if(X>BST->Data)
BST->Right = Delete(BST->Right,X);
else{
if(BST->Left&&BST->Right){
pl = FindMax(BST->Left);
BST->Data = pl->Data;
BST->Left = Delete(BST->Left,BST->Data);
}else {
temp = BST;
if(BST->Left)BST = BST ->Left;
else if(BST->Right)BST = BST ->Right;
else BST=NULL;//如果把这一行删除程序就无法通过,为什么?
free(temp);
}
}
}
return BST;
}