-
Notifications
You must be signed in to change notification settings - Fork 72
/
bimarysearchtree.cpp
57 lines (54 loc) · 971 Bytes
/
bimarysearchtree.cpp
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
#include <iostream>
#include <queue>
//#include"bits/stdc++.h"
using namespace std;
struct Node
{
int data;
Node *left;
Node *right;
Node(int val)
{
data = val;
left = NULL;
right = NULL;
}
};
Node *searchbst(Node *root, int key)
{
if (root->data == key)
{
return root;
}
//data>key
if (root->data > key)
{
return searchbst(root->left, key);
}
//data<key
return searchbst(root->right, key);
}
int main()
{
Node *root = new Node(4);
root->left = new Node(2);
root->right = new Node(5);
root->left->left = new Node(1);
root->left->right = new Node(3);
root->right->right = new Node(6);
// Binarysearchtree()
// 4
// / \
// 2 5
// / \ \
// 1 3 6
if (searchbst(root, 5) == NULL)
{
cout << "key does not exist";
}
else
{
cout << "key exist";
}
return 0;
}