1.概念
二叉搜索树又称二叉排序树，它或者是一棵空树，或者是具有以下性质的二叉树:
若它的左子树不为空，则左子树上所有节点的值都小于根节点的值。
若它的右子树不为空，则右子树上所有节点的值都大于根节点的值。
它的左右子树也分别为二叉搜索树。
特性是去重加排序。二叉搜索树不允许相同的值插入，在遍历时，通常采用中序遍历的方式从而具有排序的作用。
2.二叉搜索树的应用
2.1 K模型
K模型：K模型即只有key作为关键码，结构中只需要存储Key即可，关键码即为需要搜索到
的值。
2.11实现
（1）搜索树结点结构体
template <class K>
struct BSTreeNode
{
BSTreeNode<K>* _left;
BSTreeNode<K>* _right;
K _key;
BSTreeNode(const K& key)
:_key(key)
,_left(nullptr)
,_right(nullptr)
{
;
}
};用于创建搜索树的结点。
搜索树包含的成员是一个根_root。
template <class K>
class BSTree
{
public:
typedef BSTreeNode<K> Node;
private:
Node* _root = nullptr;
};（2）插入函数
插入函数可以有非递归和递归版本。
非递归：
bool Insert(const K& key)
{
if (_root == nullptr)
{
_root = new Node(key);
return true;
}
else
{
Node* cur = _root;
Node* parent = nullptr;
while (cur)
{
if (key < cur->_key)
{
parent = cur;
cur = cur->_left;
}
else if (key > cur->_key)
{
parent = cur;
cur = cur->_right;
}
else
{
return false;
}
}
cur = new Node(key);
if (key < parent->_key)
{
parent->_left = cur;
}
else
{
parent->_right = cur;
}
return true;
}
}思路：树为空，就创建一个结点。树不为空，就比较key，比当前结点的key小就走左结点，比当前结点的key大就走右结点。循环走完后，cur要与parent链接。
递归：
bool InsertR(const K& key)
{
return _InsertR(_root, key);
}
private:
bool _InsertR(Node*& root, const K& key)
{
if (root == nullptr)
{
root = new Node(key);
return true;
}
if (root->_key < key)
{
return _InsertR(root->_right, key);
}
else if (root->_key > key)
{
return _InsertR(root->_left, key);
}
else
{
return false;
}
}类外无法访问私有成员_root,所以采用了一个封装的写法。
（3）删除函数
非递归：
bool Erase(const K& key)
{
Node* parent = nullptr;
Node* cur = _root;
while (cur)
{
if (cur->_key < key)
{
parent = cur;
cur = cur->_right;
}
else if (cur->_key > key)
{
parent = cur;
cur = cur->_left;
}
else
{
//找到结点，开始删除
//1.左为空
//2.右为空
//3.左右都不为空
if (cur->_left == nullptr)
{
if (cur == _root)
{
_root = cur->_right;
}
else
{
if (cur == parent->_left)
{
parent->_left = cur->_right;
}
else
{
parent->_right = cur->_right;
}
}
delete cur;
cur = nullptr;
}
else if (cur->_right == nullptr)
{
if (cur == _root)
{
_root = cur->_left;
}
else
{
if (cur == parent->_left)
{
parent->_left = cur->_left;
}
else
{
parent->_right = cur->_left;
}
}
delete cur;
cur = nullptr;
}
else
{
//替换法 找左树最大结点或者右树最小结点来替换
Node* Min = cur->_right;
Node* MinParent = cur;
while (Min)
{
if (Min->_left == nullptr)
break;
parent = MinParent;
Min = Min->_left;
}
swap(cur->_key, Min->_key);
if (Min == MinParent->_left)
{
MinParent->_left = Min->_right;
}
else
{
MinParent->_right = Min->_right;
}
delete Min;
Min = nullptr;
}
}
return true;
}
return false;
}思路：找结点，当cur为空则找不到，不为空分为三种情况，左为空，右为空和左右都不为空的情况。左右都不为空时需要用替换法，即找到左子树最大结点或者右子树最小结点来替换删除结点，最后转换成左为空和右为空的情况来删除。
递归：
bool EraseR(const K& key)
{
return _EraseR(_root, key);
}
private:
bool _EraseR(Node*& root, const K& key)
{
if (root == nullptr)
{
return false;
}
if (root->_key < key)
{
return _EraseR(root->right, key);
}
else if (root->_key > key)
{
return _EraseR(root->_left, key);
}
else
{
Node* del = root;
if (root->_left == nullptr)
{
root = root->_right;
}
else if (root->_right == nullptr)
{
root = root->_left;
}
else
{
Node* Min = root->_right;
while (Min->_left)
{
Min = Min->_left;
}
swap(root->_key, Min->_key);
return _Erase(root->_right, key);
}
delete del;
return true;
}
}（4）查找函数
非递归：
bool Find(const K& key)
{
Node* cur = _root;
while (cur)
{
if (key < cur->_key)
{
cur = cur->_left;
}
else if (key > cur->_key)
{
cur = cur->_right;
}
else
{
return true;
}
}
return false;
}思路：比当前结点的key小就走左结点，比当前结点的key大就走右结点。
递归：
bool FindR(const K& key)
{
return _FindR(_root, key);
}
private:
bool _FindR(Node* root,const K& key)
{
if (root == nullptr)
{
return false;
}
if (root->_key < key)
{
return _FindR(root->_right, key);
}
else if (root->_key > key)
{
return _FindR(root->_left, key);
}
else
{
return true;
}
}（5）构造函数、析构函数、拷贝构造、赋值重载、中序遍历
void InOrder()
{
_InOrder(_root);
cout << endl;
}
~BSTree()
{
_Destory(_root);
}
BSTree(const BSTree<K>& t)
{
_root = _Copy(t._root);
}
/*BSTree()
{}*/
//写了拷贝构造，编译器就不会生成默认构造函数，因此需要强制让编译器生成构造函数
BSTree() = default;
BSTree<K>& operator=(BSTree<K> t)
{
swap(_root, t._root);
return *this;
}
private：
Node* _Copy(Node* root)
{
if (root == nullptr)
{
return nullptr;
}
Node* CopyRoot = new Node(root->_key);
CopyRoot->_left = _Copy(root->_left);
CopyRoot->_right = _Copy(root->_right);
return CopyRoot;
}
void _Destory(Node*& root)
{
if (root == nullptr)
{
return;
}
_Destory(root->_left);
_Destory(root->_right);
delete root;
root = nullptr;
}
void _InOrder(Node* root)
{
if (root == nullptr)
{
return;
}
_InOrder(root->_left);
cout << root->_key << " ";
_InOrder(root->_right);
}完整代码：
#pragma once
#include <iostream>
using namespace std;
namespace L
{
template <class K>
struct BSTreeNode
{
BSTreeNode<K>* _left;
BSTreeNode<K>* _right;
K _key;
BSTreeNode(const K& key)
:_key(key)
,_left(nullptr)
,_right(nullptr)
{
;
}
};
template <class K>
class BSTree
{
public:
typedef BSTreeNode<K> Node;
bool Insert(const K& key)
{
if (_root == nullptr)
{
_root = new Node(key);
return true;
}
else
{
Node* cur = _root;
Node* parent = nullptr;
while (cur)
{
if (key < cur->_key)
{
parent = cur;
cur = cur->_left;
}
else if (key > cur->_key)
{
parent = cur;
cur = cur->_right;
}
else
{
return false;
}
}
cur = new Node(key);
if (key < parent->_key)
{
parent->_left = cur;
}
else
{
parent->_right = cur;
}
return true;
}
}
bool Erase(const K& key)
{
Node* parent = nullptr;
Node* cur = _root;
while (cur)
{
if (cur->_key < key)
{
parent = cur;
cur = cur->_right;
}
else if (cur->_key > key)
{
parent = cur;
cur = cur->_left;
}
else
{
//找到结点，开始删除
//1.左为空
//2.右为空
//3.左右都不为空
if (cur->_left == nullptr)
{
if (cur == _root)
{
_root = cur->_right;
}
else
{
if (cur == parent->_left)
{
parent->_left = cur->_right;
}
else
{
parent->_right = cur->_right;
}
}
delete cur;
cur = nullptr;
}
else if (cur->_right == nullptr)
{
if (cur == _root)
{
_root = cur->_left;
}
else
{
if (cur == parent->_left)
{
parent->_left = cur->_left;
}
else
{
parent->_right = cur->_left;
}
}
delete cur;
cur = nullptr;
}
else
{
//替换法 找左树最大结点或者右树最小结点来替换
Node* Min = cur->_right;
Node* MinParent = cur;
while (Min)
{
if (Min->_left == nullptr)
break;
parent = MinParent;
Min = Min->_left;
}
swap(cur->_key, Min->_key);
if (Min == MinParent->_left)
{
MinParent->_left = Min->_right;
}
else
{
MinParent->_right = Min->_right;
}
delete Min;
Min = nullptr;
}
}
return true;
}
return false;
}
bool Find(const K& key)
{
Node* cur = _root;
while (cur)
{
if (key < cur->_key)
{
cur = cur->_left;
}
else if (key > cur->_key)
{
cur = cur->_right;
}
else
{
return true;
}
}
return false;
}
void InOrder()
{
_InOrder(_root);
cout << endl;
}
bool FindR(const K& key)
{
return _FindR(_root, key);
}
bool InsertR(const K& key)
{
return _InsertR(_root, key);
}
bool EraseR(const K& key)
{
return _EraseR(_root, key);
}
~BSTree()
{
_Destory(_root);
}
BSTree(const BSTree<K>& t)
{
_root = _Copy(t._root);
}
/*BSTree()
{}*/
//写了拷贝构造，编译器就不会生成默认构造函数，因此需要强制让编译器生成构造函数
BSTree() = default;
BSTree<K>& operator=(BSTree<K> t)
{
swap(_root, t._root);
return *this;
}
private:
Node* _Copy(Node* root)
{
if (root == nullptr)
{
return nullptr;
}
Node* CopyRoot = new Node(root->_key);
CopyRoot->_left = _Copy(root->_left);
CopyRoot->_right = _Copy(root->_right);
return CopyRoot;
}
void _Destory(Node*& root)
{
if (root == nullptr)
{
return;
}
_Destory(root->_left);
_Destory(root->_right);
delete root;
root = nullptr;
}
bool _EraseR(Node*& root, const K& key)
{
if (root == nullptr)
{
return false;
}
if (root->_key < key)
{
return _EraseR(root->right, key);
}
else if (root->_key > key)
{
return _EraseR(root->_left, key);
}
else
{
Node* del = root;
if (root->_left == nullptr)
{
root = root->_right;
}
else if (root->_right == nullptr)
{
root = root->_left;
}
else
{
Node* Min = root->_right;
while (Min->_left)
{
Min = Min->_left;
}
swap(root->_key, Min->_key);
return _Erase(root->_right, key);
}
delete del;
return true;
}
}
bool _InsertR(Node*& root, const K& key)
{
if (root == nullptr)
{
root = new Node(key);
return true;
}
if (root->_key < key)
{
return _InsertR(root->_right, key);
}
else if (root->_key > key)
{
return _InsertR(root->_left, key);
}
else
{
return false;
}
}
bool _FindR(Node* root,const K& key)
{
if (root == nullptr)
{
return false;
}
if (root->_key < key)
{
return _FindR(root->_right, key);
}
else if (root->_key > key)
{
return _FindR(root->_left, key);
}
else
{
return true;
}
}
void _InOrder(Node* root)
{
if (root == nullptr)
{
return;
}
_InOrder(root->_left);
cout << root->_key << " ";
_InOrder(root->_right);
}
Node* _root = nullptr;
};
2.2 K/V模型
KV模型：每一个关键码key，都有与之对应的值Value，即<Key, Value>的键值对。类似场景：英汉字典，统计单词次数，统计水果数量。
KV模型整体与K模型结构框架差不多，只不过多了一个成员Value。
完整代码：
template <class K, class V>
class BSTree
{
public:
typedef BSTreeNode<K, V> Node;
bool Insert(const K& key, const V& value)
{
if (_root == nullptr)
{
_root = new Node(key, value);
return true;
}
else
{
Node* cur = _root;
Node* parent = nullptr;
while (cur)
{
if (key < cur->_key)
{
parent = cur;
cur = cur->_left;
}
else if (key > cur->_key)
{
parent = cur;
cur = cur->_right;
}
else
{
return false;
}
}
cur = new Node(key, value);
if (key < parent->_key)
{
parent->_left = cur;
}
else
{
parent->_right = cur;
}
return true;
}
}
bool Erase(const K& key)
{
Node* parent = nullptr;
Node* cur = _root;
while (cur)
{
if (cur->_key < key)
{
parent = cur;
cur = cur->_right;
}
else if (cur->_key > key)
{
parent = cur;
cur = cur->_left;
}
else
{
//找到结点，开始删除
//1.左为空
//2.右为空
//3.左右都为空
if (cur->_left == nullptr)
{
if (cur == _root)
{
_root = cur->_right;
}
else
{
if (cur == parent->_left)
{
parent->_left = cur->_right;
}
else
{
parent->_right = cur->_right;
}
}
delete cur;
cur = nullptr;
}
else if (cur->_right == nullptr)
{
if (cur == _root)
{
_root = cur->_left;
}
else
{
if (cur == parent->_left)
{
parent->_left = cur->_left;
}
else
{
parent->_right = cur->_left;
}
}
delete cur;
cur = nullptr;
}
else
{
//替换法 找左树最大结点或者右树最小结点来替换
Node* Min = cur->_right;
Node* MinParent = cur;
while (Min)
{
if (Min->_left == nullptr)
break;
parent = MinParent;
Min = Min->_left;
}
swap(cur->_key, Min->_key);
if (Min == MinParent->_left)
{
MinParent->_left = Min->_right;
}
else
{
MinParent->_right = Min->_right;
}
delete Min;
Min = nullptr;
}
}
return true;
}
return false;
}
Node* Find(const K& key)
{
Node* cur = _root;
while (cur)
{
if (key < cur->_key)
{
cur = cur->_left;
}
else if (key > cur->_key)
{
cur = cur->_right;
}
else
{
return cur;
}
}
return nullptr;
}
void InOrder()
{
_InOrder(_root);
cout << endl;
}
~BSTree()
{
_Destory(_root);
};
private:
void _Destory(Node*& root)
{
if (root == nullptr)
{
return;
}
_Destory(root->_left);
_Destory(root->_right);
delete root;
root = nullptr;
}
void _InOrder(Node* root)
{
if (root == nullptr)
{
return;
}
_InOrder(root->_left);
cout << root->_key << ":" << root->_value << endl;
_InOrder(root->_right);
}
Node* _root = nullptr;
};
8万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
