二叉查找树

头文件：

class BinaryTreeNode

{
public:
BinaryTreeNode():key(0),left(NULL),right(NULL){};
BinaryTreeNode(int value, BinaryTreeNode *L,BinaryTreeNode *R):left(L),right(R),key(value){};
friend class BinaryTree;
private:
BinaryTreeNode *left;
BinaryTreeNode *right;
int key;

};

源文件：

class BinaryTree
{
public:
BinaryTree():root(NULL){} 
BinaryTree(BinaryTreeNode *node){root=node;}
void inorder(BinaryTreeNode *node)
{
if(node!=NULL)
{
inorder(node->left);
cout<<node->key<<" ";
inorder(node->right);
}
}

BinaryTreeNode* Find(int x,BinaryTreeNode *node)
{
while(node!=NULL)
{
if(x<node->key)
node=node->left;
else if(x>node->key)
node=node->right;
else return node;
}
return NULL;
}

BinaryTreeNode *FindMax(BinaryTreeNode *node)
{
if(node!=NULL)
{
while(node->right!=NULL)
{
node=node->right;
}
}
 return node;
}

BinaryTreeNode *FindMin(BinaryTreeNode *node)
{
 if(node!=NULL)
 while(node->left!=NULL)
 node=node->left;
 return node;
}

BinaryTreeNode* Successor(BinaryTreeNode *node)
{
if(node!=NULL)
{
if(node->right!=NULL)
return FindMin(node->right);
else return NULL;
}
return NULL;
}

BinaryTreeNode *Predecessor(BinaryTreeNode *node)
{
if(node!=NULL)
{
if(node->left!=NULL)
return FindMax(node->left);
}
}

void insert(int x,BinaryTreeNode *&node)
{
if(node==NULL)
node= new BinaryTreeNode(x,NULL,NULL);
else if(x<node->key)
insert(x,node->left);
else if(x>node->key)
insert(x,node->right);
else
;
}

void remove(int x, BinaryTreeNode *&node)
{
if(node==NULL)
return;
if(x<node->key)
remove(x,node->left);
if(x>node->key)
remove(x,node->right);
else if(node->left!=NULL&&node->right!=NULL)
{
node->key =FindMin(node->right)->key;
remove(x,node->right);
}
else
{
BinaryTreeNode *oldnode=node;
node=(node->left!=NULL)?node->left:node->right;
delete oldnode;
}
}
private:
BinaryTreeNode *root;
};