-
Notifications
You must be signed in to change notification settings - Fork 489
Expand file tree
/
Copy pathDiameteroftree.java
More file actions
88 lines (78 loc) · 2.06 KB
/
Diameteroftree.java
File metadata and controls
88 lines (78 loc) · 2.06 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
class Node {
int data;
Node left;
Node right;
Node(int data) {
this.data = data;
left = null;
right = null;
}
}
class Tree{
Node root;
Tree()
{
root=null;
}
void add(int element)
{
root = addNode(root,element);
}
Node addNode(Node node,int element)
{
if(node == null)
return new Node(element);
if(element<node.data)
node.left = addNode(node.left,element);
else
if(element> node.data)
node.right = addNode(node.right,element);
return node;
}
int height (Node root)
{
if(root==null)
return 0;
return Math.max(height(root.left),height(root.right))+1;
}
int diameter()
{
return diameter(root);
}
int diameter(Node root)
{
// base case if tree is empty
if (root == null)
return 0;
// get the height of left and right sub-trees
int lheight = height(root.left);
int rheight = height(root.right);
// get the diameter of left and right sub-trees
int ldiameter = diameter(root.left);
int rdiameter = diameter(root.right);
/* Return max of following three
1) Diameter of left subtree
2) Diameter of right subtree
3) Height of left subtree + height of right subtree + 1
*/
// This return statement deals with 3 cases that which among the
//current diameter, left diameter, right diameter is greatest
// current diameter = left height + right height +1
return Math.max(lheight + rheight + 1,
Math.max(ldiameter, rdiameter));
}
}
public class Diameteroftree {
public static void main(String[] args) {
Tree obj = new Tree();
obj.add(4);
obj.add(3);
obj.add(2);
obj.add(9);
obj.add(6);
obj.add(1);
obj.add(12);
obj.add(13);
System.out.println(obj.diameter());
}
}