-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathBST.cpp
More file actions
188 lines (153 loc) · 3.73 KB
/
BST.cpp
File metadata and controls
188 lines (153 loc) · 3.73 KB
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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
#include <bits/stdc++.h> // all c++ libraries
// defines
#define faster_io ios_base::sync_with_stdio(false);cin.tie()
#define rep(i,a) for(int i=0;i<a;i++)
#define rrep(i,a) for(int i=a-1,i>=0;i--)
#define range(i,a,b) for(int i=a;i<=b;i++)
#define rrange(i,a,b) for(int i=a;i>=b;i--)
#define rangev(i,a) for(int i=0;i<a.size();i++)
#define rrangev(i,a) for(int i=a.size()-1;i>=0;i--)
#define clr(a) memset(a, 0, sizeof(a))
#define all(a) a.begin(), a.end()
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define MX 200005
using namespace std;
typedef long long ll;
typedef vector <int> vi;
typedef pair <int, int> pii;
typedef vector <pii> vii;
typedef pair <int, pii> pip;
const ll INF = 1e9 + 100;
const ll MOD = 1e9 + 7;
class Node {
public:
int key;
Node *left, *right;
Node() {}
Node(int key) {
this->key = key;
this->left = this->right = NULL;
}
};
class Tree {
Node *root;
public:
Tree() {
root = NULL;
}
Node *ROOT() {
return root;
}
void addNode(int val);
void inorder(Node *leaf);
int getMax();
int getMin();
int isBST();
int maxSum();
private:
int maxSum(Node *leaf, int &sum);
void addNode(int val, Node* leaf);
int isBST(Node *leaf, int mn, int mx);
};
void Tree::addNode(int val) {
if(root == NULL) {
root = new Node(val);
} else {
addNode(val, root);
}
}
void Tree::addNode(int val, Node *leaf) {
if(leaf->key < val) {
if(leaf->right == NULL) {
leaf->right = new Node(val);
} else {
addNode(val, leaf->right);
}
} else {
if(leaf->left == NULL) {
leaf->left = new Node(val);
} else {
addNode(val, leaf->left);
}
}
}
void Tree::inorder(Node *leaf) {
if(leaf) {
inorder(leaf->left);
cout << leaf->key << " ";
inorder(leaf->right);
}
}
int Tree::getMax() {
if(root == NULL) {
return -1;
}
Node *leaf = root;
while(leaf->right != NULL) {
leaf = leaf->right;
}
return leaf->key;
}
int Tree::getMin() {
if(root == NULL) {
return -1;
}
Node *leaf = root;
while(leaf->left != NULL) {
leaf = leaf->left;
}
return leaf->key;
}
int Tree::isBST() {
return isBST(root, INT_MIN, INT_MAX);
}
int Tree::isBST(Node *leaf, int mn, int mx) {
if(leaf == NULL) {
return 1;
}
if(leaf->key < mn || leaf->key > mx) {
return 0;
}
return (isBST(leaf->left, mn, leaf->key + 1) && isBST(leaf->right, leaf->key + 1, mx));
}
int Tree::maxSum() {
int ret = INT_MIN;
maxSum(root, ret);
return ret;
}
int Tree::maxSum(Node *leaf, int &sum) {
if(leaf == NULL) {
return 0;
}
int l = maxSum(leaf->left, sum);
int r = maxSum(leaf->right, sum);
int max_single = max(max(l, r) + leaf->key, leaf->key);
int max_top = max(max_single, l + r + leaf->key);
sum = max(sum, max_top);
return max_single;
}
int main() {
faster_io;
Tree *tree = new Tree();
int arr[10] = {5, 8, 4, 6, 1, 7, 3, 9, 2, 5};
int len = sizeof(arr) / sizeof(arr[0]);
cout << "ARRAY :\t";
rep(i, len) {
cout << arr[i] << " ";
}
cout << "\n";
rep(i, len) {
tree->addNode(arr[i]);
}
cout << "SORTED :\t";
tree->inorder(tree->ROOT());
cout << "\n";
cout << "MAX : " << tree->getMax() << "\n";
cout << "MIN : " << tree->getMin() << "\n";
cout << "isBST : " << (tree->isBST() == 1 ? "Yes" : "No") << "\n";
cout << "MaxSum : " << tree->maxSum() << "\n";
return 0;
}