Binary Search Tree

发表于 | 分类于

Binary Search Tree

题目描述：

用C++语言构造搜索二叉树。包括基本的功能；先序遍历，中序遍历，后序遍历，取最大值，取最小值，插入，删除，查找。

代码如下：

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
#include <iostream>
using namespace std;
template <typename T>
class TreeNode{
public:
    TreeNode* left;
    TreeNode* right;
    T value;
    TreeNode(T key): value(key), left(NULL), right(NULL){};
    TreeNode(T key, TreeNode* l, TreeNode* r): value(key), left(l), right(r){};
};
//构造二叉树的节点类
template <typename T>
class BSTree{
public:
    BSTree() = default;
    BSTree(TreeNode<T>* node): root(node) {};
    ~BSTree(){};
    void preOrder();
    void inOrder();
    void postOrder();
    void insert(T value);
//    void insert(TreeNode* node);
    void search(T value);
//    void del(T value);
    bool empty();
    TreeNode<T>* getMin();
    TreeNode<T>* getMax();
private:
    TreeNode<T>* root;
    void preOrder(TreeNode<T>* const node) const;
    void inOrder(TreeNode<T>* const node) const;
    void postOrder(TreeNode<T>* const node) const;
    void search(TreeNode<T>* node, T key);
    TreeNode<T>* getMin(TreeNode<T>* const node);
    TreeNode<T>* getMax(TreeNode<T>* const node);
    bool empty(TreeNode<T>* node);
    void insert(TreeNode<T>* node, T value);
};
template <typename T>
void BSTree<T>::preOrder(TreeNode<T>* const node) const {
    if (node) {
        cout << node->value << endl;
        preOrder(node->left);
        preOrder(node->right);
    }else{
        return;
    }
}
template <typename T>
void BSTree<T>::preOrder() {
    preOrder(root);
}
template <typename T>
void BSTree<T>::inOrder(TreeNode<T>* const node) const {
    if (node){
        inOrder(node->left);
        cout << node->value << endl;
        inOrder(node->right);
    }else{
        return;
    }
}
template <typename T>
void BSTree<T>::inOrder() {
    inOrder(root);
}
template <typename T>
void BSTree<T>::postOrder(TreeNode<T>* const node) const {
    if (node){
        postOrder(node->left);
        postOrder(node->right);
        cout << node->value << endl;
    }else{
        return;
    }
}
template <typename T>
void BSTree<T>::postOrder() {
    postOrder(root);
}
template <typename T>
void BSTree<T>::search(TreeNode<T> * node, T value) {
    if (!node) {
        if (value == node->value) {
            cout << "the value is in this tree" << endl;
            return;
        }
        if (value > node->value)
            search(node->right, value);
        if (value < node->value)
            search(node->left, value);
    }
    return;
}
template <typename T>
void BSTree<T>::search(T value) {
    search(root, value);
}
template <typename T>
TreeNode<T>* BSTree<T>::getMin(TreeNode<T> *const node) {
    TreeNode<T>* tmp = node;
    while(tmp->left){
        tmp = tmp->left;
    }
    return tmp;
}
template <typename T>
TreeNode<T>* BSTree<T>::getMin() {
    getMin(root);
}
template <typename T>
TreeNode<T>* BSTree<T>::getMax(TreeNode<T> *const node) {
    TreeNode<T>* tmp = node;
    while(tmp->right){
        tmp = tmp->right;
    }
    return tmp;
}
template <typename T>
TreeNode<T>* BSTree<T>::getMax() {
    getMax(root);
}
template <typename T>
bool BSTree<T>::empty(TreeNode<T>* node){
    return node == NULL;
}
template <typename T>
bool BSTree<T>::empty(){
    return empty(root);
}
template <typename T>
void BSTree<T>::insert(TreeNode<T>* node, T value) {
    if (node == NULL){
        TreeNode<T>* tmp = new TreeNode<T>(value);
        node = tmp;
    }
    if (node->value > value){
        if (node->left == NULL){
            TreeNode<T>* tmp = new TreeNode<T>(value);
            node->left = tmp;
        }else{
            insert(node->left, value);
        }
    }else{
        if (node->right == NULL){
            TreeNode<T>* tmp = new TreeNode<T>(value);
            node->right = tmp;
        }else{
            insert(node->right, value);
        }
    }
}
template <typename T>
void BSTree<T>::insert(T value) {
    insert(root, value);
}