二叉搜索树代码填空练习答案.pdfVIP

BinarySearchTree

typedefstructSearchTreeInsert

TreeNode{ElementType(ElementTypeX,SearchTreeT)

Element;SearchTreeLeft;{

SearchTreeRight;if(T==NULL){

}*SearchTree,*Position;T=malloc(sizeof(structTreeNode));

SearchTreeMakeEmpty(SearchTreeT)if(T==NULL)

{printf(Outofspace!!!);

if(T!=NULL)else{

{T-Element=X;

MakeEmpty(T-Left);T-Left=T-Right=NULL;

MakeEmpty(T-Right);}

free(T);}

}elseif(XT-Element)

returnNULL;T-Left=Insert(X,T-Left);

}elseif(XT-Element)

PositionFind(ElementTypeX,SearchTreeT)T-Right=Insert(X,T-Right);

{returnT;

if(T==NULL)}

returnNULL;SearchTreeDelete

if(XT-Element)(ElementTypeX,SearchTreeT)

returnFind(X,T-Left);{

elsePositionTmpCell;

if(XT-Element)if(T==NULL)

returnFind(X,T-Right);printf(Elementnotfound);

else