-
Notifications
You must be signed in to change notification settings - Fork 0
/
Diameter.cpp
114 lines (101 loc) · 2.62 KB
/
Diameter.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
#include <stdio.h>
#include <stdlib.h>
struct node
{
int data;
struct node* left, *right;
};
int max(int a, int b)
{
return (a >= b)? a: b;
}
struct node* newNode(int data)
{
struct node* node = (struct node*)
malloc(sizeof(struct node));
node->data = data;
node->left = NULL;
node->right = NULL;
return(node);
}
int height(struct node* node)
{
/* base case tree is empty */
if(node == NULL)
return 0;
/* If tree is not empty then height = 1 + max of left
height and right heights */
return 1 + max(height(node->left), height(node->right));
}
void printr(node* root){
if(root==NULL)
return;
printf("%d ", root->data);
int lh = height(root->left);
int rh = height(root->right);
if(lh>=rh)
printr(root->left);
else
printr(root->right);
}
void print(node*root){
if(root==NULL)
return;
printf("%d ", root->data);
printr(root->left);
printr(root->right);
}
int diameter(struct node *root, int* height, node* *node)
{
/* lh --> Height of left subtree
rh --> Height of right subtree */
int lh = 0, rh = 0;
/* ldiameter --> diameter of left subtree
rdiameter --> Diameter of right subtree */
int ldiameter = 0, rdiameter = 0;
if(root ==NULL)
{
*height = 0;
return 0; /* diameter is also 0 */
}
/* Get the heights of left and right subtrees in lh and rh
And store the returned values in ldiameter and ldiameter */
ldiameter = diameter(root->left, &lh,node);
rdiameter = diameter(root->right, &rh,node);
/* Height of current node is max of heights of left and
right subtrees plus 1*/
*height = max(lh, rh) + 1;
int t = lh + rh + 1;
if(((t)>=ldiameter)&&((t)>=rdiameter))
*node = root;
else if((ldiameter>=(t))&&(ldiameter>= rdiameter))
*node = root->left;
else if((rdiameter>=(t))&&(rdiameter>= ldiameter))
*node = root->right;
return max(t, max(ldiameter, rdiameter));
}
int main()
{
/* Constructed binary tree is
1
/ \
2 3
/ \
4 5
*/
struct node *root = newNode(1);
root->left = newNode(2);
//root->right = newNode(3);
root->left->left = newNode(4);
root->left->right = newNode(5);
root->left->left->left = newNode(6);
//root->left->left->left->left = newNode(16);
root->left->right->right = newNode(7);
root->left->right->right->right = newNode(8);
int h=0;
node* r;
printf("Diameter of the given binary tree is %d\n", diameter(root,&h,&r));
//printf("%d", r->data);
print(r);
return 0;
}