BST二叉排序/查找/搜索树C++实现
实现代码
#include<bits/stdc++.h>
using namespace std;
struct Node {
int data;
Node *left;
Node *right;
Node(int value) : data(value), left(NULL), right(NULL) {}
Node(int value, Node* l, Node* r) : data(value), left(l), right(r) {}
};
class BST {
private:
Node* root;
void inOrderTraverse(Node* p);
void reverseInOrderTraverse(Node *p);
public:
BST();
Node* search(int value);
void insert(int value);
void del(int value);
void incrementalSequence();
void decreasingSequence();
};
Node* BST::search(int value) {
Node *p = root;
while (p && p->data != value) {
p = (value > p->data ? p->right : p->left);
}
return p;
}
void BST::insert(int value) {
Node *parent = NULL;
Node *p = root;
while (p) {
parent = p;
if (value == p->data) {
printf("The element has exist!\n");
return;
} else {
p = (value > p->data ? p->right : p->left);
}
}
if (parent == NULL) {
root = new Node(value);
} else if (value < parent->data) {
parent->left = new Node(value, parent->left, NULL);
} else if (value > parent->data) {
parent->right = new Node(value, NULL, parent->right);
}
}
void BST::del(int value) {
Node *parent = NULL;
Node* p = root;
while (p && p->data != value) {
parent = p;
p = (value > p->data ? p->right : p->left);
}
if (!p) {
return;
} else if (!p->left && !p->right) {
if (parent->left == p) {
parent->left = NULL;
} else {
parent->right = NULL;
}
delete p;
} else if (p->left && !p->right) {
if (parent->left == p) {
parent->left = p->left;
} else {
parent->right = p->left;
}
delete p;
} else if (!p->left && p->right) {
if (parent->left == p) {
parent->left = p->right;
} else {
parent->right = p->right;
}
delete p;
} else {
Node *q = p->right;
Node *parentQ = p;
while (q->left) {
parentQ = q;
q = q->left;
}
p->data = q->data;
if (parentQ->left == q) {
parentQ->left = q->right;
} else {
parentQ->right = q->right;
}
delete q;
}
}
BST::BST() {
root = NULL;
}
void BST::incrementalSequence() {
inOrderTraverse(root);
}
void BST::inOrderTraverse(Node *p) {
if (!p) {
return;
}
inOrderTraverse(p->left);
printf("%d ", p->data);
inOrderTraverse(p->right);
}
void BST::decreasingSequence() {
reverseInOrderTraverse(root);
}
void BST::reverseInOrderTraverse(Node *p) {
if (!p) {
return;
}
reverseInOrderTraverse(p->right);
printf("%d ", p->data);
reverseInOrderTraverse(p->left);
}
int main(int argc, char const *argv[])
{
BST binarySearchTree;
int N;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
int value;
scanf("%d", &value);
binarySearchTree.insert(value);
}
printf("Incrementail sequence:\n");
binarySearchTree.incrementalSequence();
printf("\n");
printf("Delete elements:");
int value;
scanf("%d", &value);
binarySearchTree.del(value);
printf("Incrementail sequence:\n");
binarySearchTree.incrementalSequence();
printf("\nDecrease sequence:\n");
binarySearchTree.decreasingSequence();
printf("\nSearch value:");
scanf("%d", &value);
printf("Search %d", binarySearchTree.search(value)->data);
return 0;
}
输入数据
10
10 24 88 20 5 8 4 99 90 9
10
24
输出数据
10
10 24 88 20 5 8 4 99 90 9
Incrementail sequence:
4 5 8 9 10 20 24 88 90 99
Delete elements:10
Incrementail sequence:
4 5 8 9 20 24 88 90 99
Decrease sequence:
99 90 88 24 20 9 8 5 4
Search value:24
Search 24
二叉排序树
- 简介
BST,二叉排序树(Binary Sort Tree),也称二叉查找(排序)树(Binary Search Tree) - 定义
递归地,或者是一棵空树,或者是具有下列性质的二叉树:
- 若左子树非空,则左子树上所有结点的关键字均小于它的根结点的值;
- 若右子树非空,则右子树上所有结点的关键字均大于它的根结点的值;
- 左、右子树本身也分别为二叉排序树;
- 二叉排序树中所有结点关键字唯一
- 实现
实现的思路和重要代码部分在上述实现中已详细注释 - 时间复杂度
搜索、插入、删除时间复杂度为O(lgn),n为BST结点总数
样例图解
- BST
![](https://img-blog.csdnimg.cn/20200508113221523.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ0NDg2NDM5,size_16,color_FFFFFF,t_70)
- 删除关键字为10的节点后
![在这里插入图片描述](https://img-blog.csdnimg.cn/20200508113316312.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ0NDg2NDM5,size_16,color_FFFFFF,t_70)
最后
- 最坏情况下,即二叉树构造输入序列为有序,会形成一个单支树,深度为BST中结点总数,时间复杂度为O(n),此时BST性能显著降低,时间复杂度取决于BST的深度
- 由于博主水平有限,不免有疏漏之处,欢迎读者随时批评指正,以免造成不必要的误解!