C++实现二叉搜索树的插入、搜索、删除

//二叉树的插入
//迭代
TreeNode* insertIntoBST(TreeNode* root, int val)
{
if (!root)
{
TreeNode node = new TreeNode(val);
return node;
}
else {
TreeNode p = root;
while (true)
{
if (p->val > val)//左子树
{
if (p->left == NULL)
{
p->left = new TreeNode(val);
break;
}
else
p = p->left;
}
else if (p->val < val)//右子树
{
if (p->right == NULL)
{
p->right = new TreeNode(val);
break;
}
else
p = p->right;
}
}
}
return root;
}
//递归
TreeNode insertIntoBST(TreeNode root, int val)
{
if (!root)
return new TreeNode(val);
if (root->val > val)//left
root->left = insertIntoBST(root->left, val);
else
root->right = insertIntoBST(root->right, val);
return root;
}
//二叉树的搜索
//递归
TreeNode* searchBST(TreeNode* root, int val)
{
if (!root)
return nullptr;
if (root->val == val)
return root;
else if (root->val > val)
return searchBST(root->left, val);
else
return searchBST(root->right, val);
}
//迭代
TreeNode* searchBST(TreeNode* root, int val)
{
while (root&&root->val != val)
root = (root->val < val) ? root->right : root->left;
return root;
}
//删除
TreeNode* deleteNode(TreeNode* root, int key)
{
if (!root)
return NULL;
if (root->val > key)//left
root->left = deleteNode(root->left, key);
else if (root->val < key)//right
root->right = deleteNode(root->right, key);
else {
if (!root->left || !root->right)//左右有一个不存在的话直接root指向另一个
root = (root->left) ? root->left : root->right;
else//都存在，则找到右子树中最小的节点，然后再递归删除
{
TreeNode cur = root->right;
while (cur->left)
cur = cur->left;
root->val = cur->val;
root->right = deleteNode(root->right, cur->val);
}
}
}
//适合所有树的删除
TreeNode deleteNode(TreeNode* root, int key)
{
if (!root) return NULL;
if (root->val == key) {
if (!root->right)
return root->left;
else
{
TreeNode *cur = root->right;
while (cur->left)
cur = cur->left;
swap(root->val, cur->val);
}
}
root->left = deleteNode(root->left, key);
root->right = deleteNode(root->right, key);
return root;
}