binary search tree first version

 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
#include <iostream>
struct tnode {
int value;
tnode* left;
tnode* right;
tnode() {
left == NULL;
right == NULL;
}
};
bool search_bst(tnode* rootTree, int searcher) {
if (rootTree == NULL) {
return false;
} else if (rootTree->value > searcher) {
return search_bst(rootTree->left, searcher);
} else if (rootTree->value < searcher) {
return search_bst(rootTree->right, searcher);
} else if (rootTree->value == searcher) {
return true;
}
}
void insertNode(tnode*& rootTree, tnode* newNode) {
if (rootTree == NULL) {
rootTree = newNode;
} else if (rootTree->value > newNode->value) {
insertNode(rootTree->left, newNode);
} else {
insertNode(rootTree->right, newNode);
}
}
int main() {
tnode* rootTree;
tnode* right;
tnode* left;
right = new tnode;
right->value = 12;
left = new tnode;
left->value = 8;
rootTree = new tnode;
rootTree->value = 10;
insertNode(rootTree, right);
insertNode(rootTree, left);
if (search_bst(rootTree, 12)) {
std::cout<<"key exists"<<std::endl;
}
delete right;
delete left;
delete rootTree;
return 0;
}