-
Notifications
You must be signed in to change notification settings - Fork 0
/
check1.cpp
127 lines (126 loc) · 1.97 KB
/
check1.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
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
#include<iostream>
using namespace std;
struct node
{
int key_value;
node *left;
node *right;
};
class btree
{
public:
btree();
~btree();
void insert(int key);
node *search(int key);
void destroy_tree();
void inordertrav();
private:
void destroy_tree(node *leaf);
void insert(int key, node *leaf);
node *search(int key, node *leaf);
void inorder(node *leaf);
node *root;
};
void btree::inordertrav()
{
inorder(root);
}
void btree::inorder(node *ptr)
{
if(ptr!=NULL)
{
inorder(ptr->left);
inorder(ptr->right);
}
}
btree::btree()
{
root = NULL;
}
void btree::destroy_tree(node *leaf)
{
if(leaf !=NULL)
{
destroy_tree(leaf->left);
destroy_tree(leaf->right);
delete leaf;
}
}
void btree::insert(int key, node *leaf)
{
if(key < leaf->key_value)
{
if(leaf->left != NULL)
insert(key,leaf->left);
else
{
leaf->left = new node;
leaf->left->key_value=key;
leaf->left->left=NULL;
leaf->left->right=NULL;
}
}
else if(key>=leaf->key_value)
{
if(leaf->right!= NULL)
insert(key,leaf->right);
else
{
leaf->right = new node;
leaf->right->key_value=key;
leaf->right->left=NULL;
leaf->right->right=NULL;
}
}
}
node *btree ::search(int key, node *leaf)
{
if(leaf!=NULL)
{
if(key == leaf->key_value)
return leaf;
if(key<leaf->key_value)
return search(key,leaf->left);
else
return search(key,leaf->right);
}
else
return NULL;
}
void btree::insert(int key)
{
if(root!=NULL)
insert(key,root);
else
{
root = new node;
root->key_value = key;
root->left= NULL;
root->right= NULL;
}
}
node *btree::search(int key)
{
return search(key,root);
}
void btree::destroy_tree()
{
destroy_tree(root);
}
int main()
{
int t;
cin>>t;
while(t--)
{
long long int a,q,s,b;
//cin>>q>>s>>a>>b;
for(int i = 0; i< 30000000;i++)
{
a++;
}
cout<<a;
}
return 0;
}