-
Notifications
You must be signed in to change notification settings - Fork 0
/
search_target.cpp
90 lines (81 loc) · 1.8 KB
/
search_target.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
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
#include<bits/stdc++.h>
using namespace std;
class node{
public:
int data;
node* left;
node* right;
node(int data){
this -> data = data;
left = NULL;
right = NULL;
}
};
node* insertToBST(node* root, int data){
if(root == NULL){
root = new node(data);
return root;
}
if(root -> data > data){
// insert that data on left
root -> left = insertToBST(root -> left, data);
}
else{
// insert that data on right
root -> right = insertToBST(root -> right, data);
}
return root ;
}
void takeInput(node* &root){
int data;
cin >> data;
while(data != -1){
root = insertToBST(root, data);
cin >> data;
}
}
void levelorder(node* root){
queue<node*>q;
q.push(root);
q.push(NULL);
while(!q.empty()){
node* temp = q.front();
q.pop();
// s3
if(temp == NULL){
cout<<endl;
if(!q.empty())
q.push(NULL);
}
else{
cout<<temp -> data<<" ";
if(temp -> left )
q.push(temp -> left);
if(temp -> right)
q.push(temp -> right);
}
}
}
bool search_target(node* root, int &target){
if(root == NULL)
return false;
if(root -> data == target)
return true;
else if(root -> data > target)
search_target(root -> left, target);
else if(root -> data < target)
search_target(root -> right, target);
}
int main(){
cout<<"enter the data you want to play"<<endl;
int a ;
cin>>a;
cout<<a;
// node* root = NULL;
// takeInput(root);
// int target;
// cin>>target;
// levelorder(root);
// bool a = search_target(root, target);
// cout<<endl<<a;
}