-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path16DiameterofBinaryTree.cpp
49 lines (39 loc) · 1.07 KB
/
16DiameterofBinaryTree.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
#include <bits/stdc++.h>
using namespace std;
struct TreeNode
{
int data;
struct TreeNode* left;
struct TreeNode* right;
TreeNode(int val)
{
data = val;
left = NULL;
right = NULL;
}
};
int diameter = 0;
int calculateHeight(TreeNode* root){
if(root==NULL){
return 0;
}
int lh = calculateHeight(root->left);
int rh = calculateHeight(root->right);
diameter = max(diameter,lh + rh);
return 1 + max(lh,rh);
}
int main(){
struct TreeNode* root = new TreeNode(2);
root->left = new TreeNode(5);
root->left->left = new TreeNode(4);
root->left->left->left = new TreeNode(3);
root->left->left->right = new TreeNode(2);
root->left->right = new TreeNode(5);
root->right = new TreeNode(7);
root->right->left = new TreeNode(9);
root->right->left->right = new TreeNode(2);
root->right->left->right->right = new TreeNode(4);
root->right->left->right->left = new TreeNode(1);
root->right->left->left = new TreeNode(3);
root->right->right = new TreeNode(7);
}