【数据结构】搜索二叉树的相关操作

1.查找最小元素

Position FindMin(BinTree BST)
{
if(!BST) return NULL;
else if(!BST->left)
return BST;
else
return FindMin(BST->left);
}

int minValue(struct node* node)
{
struct node* current = node;
while(current->left!=NULL)
{
current  = current->left;
}
return (current->data);
}

2.查找最大元素

Position FindMax(BinTree BST)
{
if(!BST) return NULL;
else if(!BST->right)
return BST;
else
return FindMin(BST->right);
}

int maxValue(struct node* node)
{
struct node* current = node;
while(current->right!=NULL)
{
current  = current->right;
}
return (current->data);
}

3.搜索二叉树插入结点

struct node* insert(struct* node,int data)
{
if(node==NULL)
{
node = (node*)malloc(sizeof(struct node));
node->data = data;
node->left = NULL;
node->right = NULL;
}
else
{
if(data<=node->data)
node->left = insert(node->left,data);
else
node->right = insert(node->right,data);
}
return node;
}