增删查改
!!!重点关注删除
BinTree Insert( BinTree BST, ElementType X )
{
if(!BST){
BST=(BinTree)malloc(sizeof(struct TNode));
BST->Data=X;
BST->Left=NULL;
BST->Right=NULL;
return BST;
}
else{
if(X>BST->Data)
{
BST->Right=Insert(BST->Right,X);
}
else{
BST->Left=Insert(BST->Left,X);
}
}
return BST;
}
BinTree Delete( BinTree BST, ElementType X )
{
BinTree tmp;
if(!BST)printf("Not Found\n");
else if(X>BST->Data) BST->Right=Delete(BST->Right,X);
else if(X<BST->Data) BST->Left=Delete(BST->Left,X);
else{
if(BST->Left&&BST->Right){
tmp=FindMin(BST->Right);
BST->Data=tmp->Data;
BST->Right=Delete(BST->Right,tmp->Data);
}
else //包含只存在一个子树和没有子树的情况
{
tmp=BST;
if(BST->Right==NULL) BST=BST->Left;
else if(BST->Left==NULL) BST=BST->Right;
/*
if(BST->Right) BST=BST->Right;
else if(BST->Left) BST=BST->Left;
else BST=NULL; 这样判断的时候记得考虑左右子树都不存在时,BST应该赋值为NULL
*/
free(tmp);
}
}
return BST;
}
Position Find( BinTree BST, ElementType X )
{
if(!BST)return NULL;
else if(X>BST->Data)
{
return Find(BST->Right,X);
}
else if(X<BST->Data)
{
return Find(BST->Left,X);
}
else return BST;
}
Position FindMin( BinTree BST )
{
if(!BST)return NULL;
while(BST->Left!=NULL)
BST=BST->Left;
return BST;
}
Position FindMax( BinTree BST )
{
if(!BST)return NULL;
while(BST->Right!=NULL)
BST=BST->Right;
return BST;
}