-
Notifications
You must be signed in to change notification settings - Fork 0
/
Diameter of a Binary Tree
178 lines (133 loc) · 3.83 KB
/
Diameter of a Binary Tree
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
//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
/* A binary tree node has data, pointer to left child
and a pointer to right child */
struct Node {
int data;
struct Node* left;
struct Node* right;
};
Node* newNode(int val) {
Node* temp = new Node;
temp->data = val;
temp->left = NULL;
temp->right = NULL;
return temp;
}
Node* buildTree(string str) {
// Corner Case
if (str.length() == 0 || str[0] == 'N') return NULL;
// Creating vector of strings from input
// string after spliting by space
vector<string> ip;
istringstream iss(str);
for (string str; iss >> str;) ip.push_back(str);
// Create the root of the tree
Node* root = newNode(stoi(ip[0]));
// Push the root to the queue
queue<Node*> queue;
queue.push(root);
// Starting from the second element
int i = 1;
while (!queue.empty() && i < ip.size()) {
// Get and remove the front of the queue
Node* currNode = queue.front();
queue.pop();
// Get the current node's value from the string
string currVal = ip[i];
// If the left child is not null
if (currVal != "N") {
// Create the left child for the current node
currNode->left = newNode(stoi(currVal));
// Push it to the queue
queue.push(currNode->left);
}
// For the right child
i++;
if (i >= ip.size()) break;
currVal = ip[i];
// If the right child is not null
if (currVal != "N") {
// Create the right child for the current node
currNode->right = newNode(stoi(currVal));
// Push it to the queue
queue.push(currNode->right);
}
i++;
}
return root;
}
// } Driver Code Ends
/* Tree node structure used in the program
struct Node
{
int data;
struct Node* left;
struct Node* right;
Node(int x){
data = x;
left = right = NULL;
}
}; */
class Solution {
private:
int height(Node* node)
{
if(node == NULL)
{
return 0;
}
int left = height(node -> left);
int right = height(node -> right);
int ans = max(left , right) + 1;
return ans;
}
pair<int, int> diameterFast(Node* root)
{
if(root == NULL)
{
pair<int, int> p = make_pair(0, 0);
return p;
}
pair<int, int> left = diameterFast( root -> left);
pair<int, int> right = diameterFast(root -> right);
int leftAns = left.first;
int rightAns = right.first;
int combo = left.second + right.second + 1;
pair<int, int> ans;
//it holds the diameter of the subtree
ans.first = max(leftAns, max(rightAns, combo));
//it holds the height of the subtree
ans.second = max(left.second, right.second) + 1;
return ans;
}
public:
// Function to return the diameter of a Binary Tree.
int diameter(Node* root) {
// if(root == NULL)
// {
// return 0;
// }
// int left = diameter(root -> left);
// int right = diameter(root -> right);
// int combo = height(root -> left) + height(root -> right) + 1;
// return max(left, max(right, combo));
return diameterFast(root).first;
}
};
//{ Driver Code Starts.
/* Driver program to test size function*/
int main() {
int t;
scanf("%d\n", &t);
while (t--) {
string s;
getline(cin, s);
Node* root = buildTree(s);
Solution ob;
cout << ob.diameter(root) << endl;
}
return 0;
}
// } Driver Code Ends