C++--二叉搜索树的应用KV模型

107 阅读 0 评论 71 点赞

我是靠谱客的博主耍酷小白菜，这篇文章主要介绍C++--二叉搜索树的应用KV模型，现在分享给大家，希望可以做个参考。

二叉搜索树的应用

KV模型

KV模型

每个关键码key，都有与之对应的值value，即<key, value>的键值对。如：英汉词典就是英文与中文的对应关系<word, chinese>。
二叉搜索树需要比较，键值对比较时，只比较key。

复制代码

#include<iostream>
using namespace std;
#include<time.h>
template<class K, class V>
struct BNode
{
K _key;
V _value;
typedef BNode<K, V> Node;
Node* _left;
Node* _right;
BNode(const K& key, const V& value)
:_key(key)
, _value(value)
, _left(nullptr)
, _right(nullptr)
{}
};
template<class K, class V>
class BTree
{
public:
typedef BNode<K, V> Node;
Node* find(const K& key)
{
Node* cur = _root;
while (cur)
{
if (cur->_key == key)
return cur;
else if (cur->_key > key)
cur = cur->_left;
else
cur = cur->_right;
}
}
//拷贝二叉搜索树的数据和结构
Node* copy(Node* root)
{
if (root == nullptr)
return nullptr;
//前序拷贝
Node* newnode = new Node(root->_key);
newnode->_left = copy(root->_left);
newnode->_right = copy(root->_right);
return newnode;
}
//拷贝构造
BTree(const BTree<K, V>& btree)
:_root(copy(btree._root))
{}
BTree()
:_root(nullptr)
{}
//不插入重复的值
bool insert(const K& key, const V& value)
{
if (_root == nullptr)
{
_root = new Node(key, value);
return true;
}
//搜索，找到合适的位置
Node* cur = _root;
Node* parent = nullptr;
while (cur)
{
parent = cur;
if (cur->_key == key)
return false;
else if (cur->_key > key)
cur = cur->_left;
else
cur = cur->_right;
}
//插入
cur = new Node(key, value);
if (parent->_key > key)
parent->_left = cur;
else
parent->_right = cur;
}
//删除
bool erase(const K& key)
{
//查找
Node* cur = _root;
Node* parent = nullptr;
while (cur)
{
if (cur->_key == key)
break;
parent = cur;
if (cur->_key > key)
cur = cur->_left;
else
cur = cur->_right;
}
//判断是否找到了要删除的节点
if (_root == nullptr)
return false;
//删除
//1.删除的为叶子节点
if (cur->_left == nullptr && cur->_right == nullptr)
{
//判断是否为根节点
if (cur == _root)
{
_root = nullptr;
}
//判断需要删除的节点在父节点哪一边
else
{
if (parent->_left == cur)
parent->_left = nullptr;
else
parent->_right = nullptr;
}
//删除节点
delete cur;
}
//2. 非叶子节点,左孩子为空
else if (cur->_left == nullptr)
{
//判断当前节点是否是根节点
if (cur == _root)
//更新根节点
_root = cur->_right;
else
{
if (parent->_left == cur)
parent->_left = cur->_right;
else
parent->_right = cur->_right;
}
//删除节点
delete cur;
}
//非叶子节点，右孩子为空
else if (cur->_right == nullptr)
{
//判断当前节点是否是根节点
if (cur == _root)
//更新根节点
_root = cur->_left;
else
{
if (parent->_left == cur)
parent->_left = cur->_left;
else
parent->_right = cur->_left;
}
//删除节点
delete cur;
}
//非叶子节点，左右孩子都存在
else
{
//1.假设找左子树的最右节点
Node* leftRightMost = cur->_left;
parent = cur;
while (leftRightMost->_right)
{
parent = leftRightMost;
leftRightMost = leftRightMost->_right;
}
//2.交换
swap(cur->_key, leftRightMost->_key);
//3. 删除最右节点
if (parent->_left == leftRightMost)
parent->_left = leftRightMost->_left;
else
parent->_right = leftRightMost->_left;
delete leftRightMost;
}
return true;
}
void inorder()
{
_inorder(_root);
cout << endl;
}
//搜索树中序遍历有序
void _inorder(Node* root)
{
if (root)
{
_inorder(root->_left);
cout << root->_key << "-->" << root->_value << " "
;
_inorder(root->_right);
}
}
void destroy(Node* root)
{
if (root)
{
destroy(root->_left);
destroy(root->_right);
cout << "destroy:" << root->_key << "-->" << root->_value << endl;
delete root;
}
}
~BTree()
{
if (_root)
{
destroy(_root);
_root = nullptr;
}
}
private:
Node* _root;
};
//void test()
//{
//	BTree<int> b;
//	srand(time(nullptr));
//	int num;
//	cin >> num;
//	for (int i = 0; i < num; i++)
//	{
//
b.insert(rand());
//	}
//	b.inorder();
//}
void test()
{
BTree<int,int> b;
b.insert(5,50);
b.insert(3,30);
b.insert(7,70);
b.insert(1,10);
b.insert(4,40);
b.insert(6,60);
b.insert(8,80);
b.insert(0,0);
b.insert(2,20);
b.insert(9,90);
b.inorder();
b.erase(5);
b.erase(3);
b.erase(8);
b.erase(9);
b.inorder();
}
int main()
{
test();
return 0;
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
#include<iostream>
using namespace std;
#include<time.h>
template<class K, class V>
struct BNode
{
K _key;
V _value;
typedef BNode<K, V> Node;
Node* _left;
Node* _right;
BNode(const K& key, const V& value)
:_key(key)
, _value(value)
, _left(nullptr)
, _right(nullptr)
{}
};
template<class K, class V>
class BTree
{
public:
typedef BNode<K, V> Node;
Node* find(const K& key)
{
Node* cur = _root;
while (cur)
{
if (cur->_key == key)
return cur;
else if (cur->_key > key)
cur = cur->_left;
else
cur = cur->_right;
}
}
//拷贝二叉搜索树的数据和结构
Node* copy(Node* root)
{
if (root == nullptr)
return nullptr;
//前序拷贝
Node* newnode = new Node(root->_key);
newnode->_left = copy(root->_left);
newnode->_right = copy(root->_right);
return newnode;
}
//拷贝构造
BTree(const BTree<K, V>& btree)
:_root(copy(btree._root))
{}
BTree()
:_root(nullptr)
{}
//不插入重复的值
bool insert(const K& key, const V& value)
{
if (_root == nullptr)
{
_root = new Node(key, value);
return true;
}
//搜索，找到合适的位置
Node* cur = _root;
Node* parent = nullptr;
while (cur)
{
parent = cur;
if (cur->_key == key)
return false;
else if (cur->_key > key)
cur = cur->_left;
else
cur = cur->_right;
}
//插入
cur = new Node(key, value);
if (parent->_key > key)
parent->_left = cur;
else
parent->_right = cur;
}
//删除
bool erase(const K& key)
{
//查找
Node* cur = _root;
Node* parent = nullptr;
while (cur)
{
if (cur->_key == key)
break;
parent = cur;
if (cur->_key > key)
cur = cur->_left;
else
cur = cur->_right;
}
//判断是否找到了要删除的节点
if (_root == nullptr)
return false;
//删除
//1.删除的为叶子节点
if (cur->_left == nullptr && cur->_right == nullptr)
{
//判断是否为根节点
if (cur == _root)
{
_root = nullptr;
}
//判断需要删除的节点在父节点哪一边
else
{
if (parent->_left == cur)
parent->_left = nullptr;
else
parent->_right = nullptr;
}
//删除节点
delete cur;
}
//2. 非叶子节点,左孩子为空
else if (cur->_left == nullptr)
{
//判断当前节点是否是根节点
if (cur == _root)
//更新根节点
_root = cur->_right;
else
{
if (parent->_left == cur)
parent->_left = cur->_right;
else
parent->_right = cur->_right;
}
//删除节点
delete cur;
}
//非叶子节点，右孩子为空
else if (cur->_right == nullptr)
{
//判断当前节点是否是根节点
if (cur == _root)
//更新根节点
_root = cur->_left;
else
{
if (parent->_left == cur)
parent->_left = cur->_left;
else
parent->_right = cur->_left;
}
//删除节点
delete cur;
}
//非叶子节点，左右孩子都存在
else
{
//1.假设找左子树的最右节点
Node* leftRightMost = cur->_left;
parent = cur;
while (leftRightMost->_right)
{
parent = leftRightMost;
leftRightMost = leftRightMost->_right;
}
//2.交换
swap(cur->_key, leftRightMost->_key);
//3. 删除最右节点
if (parent->_left == leftRightMost)
parent->_left = leftRightMost->_left;
else
parent->_right = leftRightMost->_left;
delete leftRightMost;
}
return true;
}
void inorder()
{
_inorder(_root);
cout << endl;
}
//搜索树中序遍历有序
void _inorder(Node* root)
{
if (root)
{
_inorder(root->_left);
cout << root->_key << "-->" << root->_value << " "
;
_inorder(root->_right);
}
}
void destroy(Node* root)
{
if (root)
{
destroy(root->_left);
destroy(root->_right);
cout << "destroy:" << root->_key << "-->" << root->_value << endl;
delete root;
}
}
~BTree()
{
if (_root)
{
destroy(_root);
_root = nullptr;
}
}
private:
Node* _root;
};
//void test()
//{
//	BTree<int> b;
//	srand(time(nullptr));
//	int num;
//	cin >> num;
//	for (int i = 0; i < num; i++)
//	{
//
b.insert(rand());
//	}
//	b.inorder();
//}
void test()
{
BTree<int,int> b;
b.insert(5,50);
b.insert(3,30);
b.insert(7,70);
b.insert(1,10);
b.insert(4,40);
b.insert(6,60);
b.insert(8,80);
b.insert(0,0);
b.insert(2,20);
b.insert(9,90);
b.inorder();
b.erase(5);
b.erase(3);
b.erase(8);
b.erase(9);
b.inorder();
}
int main()
{
test();
return 0;
}