forked from joharbatta/DataStructure-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbstheight.java
More file actions
120 lines (102 loc) · 2.33 KB
/
Copy pathbstheight.java
File metadata and controls
120 lines (102 loc) · 2.33 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
//find height of binary serach tree using 2 methods nodes r edges
mport java.util.*;
public class bstheight
{
Node root;
class Node
{
int data;
Node right,left;
Node(int data)
{
this.data = data;
right=left=null;
}
}
void insert(int data) {
root = insertRec(root,data);
}
Node insertRec(Node root, int data) {
if (root == null) {
root = new Node(data);
return root;
}
if (data < root.data)
root.left = insertRec(root.left, data);
else if (data > root.data)
root.right = insertRec(root.right, data);
return root;
}
void printInOrder(Node root)
{
if(root == null)
{
return;
}
else
{
printInOrder(root.left);
System.out.print(root.data + " ");
printInOrder(root.right);
}
}
int calHeight(Node root)
{
if(root == null)
{
return 0;
}
else
{
int l = calHeight(root.left);
int r = calHeight(root.right);
if(l>r)
{
return l+1;
}
else
{
return r+1;
}
}
}
int height(Node root)
{
int c=0,c1=0;
if(root==null)
{
return 0;
}
if(root!=null)
{
c=height(root.left);
c++;
c1=height(root.right);
c1++;
}
if(c>c1)
return c;
else
return c1;
}
public static void main(String []agrs)
{
bstheight tree = new bstheight();
Scanner sc = new Scanner(System.in);
System.out.println("Enter the number of nodes");
int num = sc.nextInt();
System.out.println("Enter nodes");
/*Enter the data nodes in PreOrder or just enter root node first*/
for(int i =0 ; i<num ; i++)
{
tree.insert(sc.nextInt());
}
int h=tree.calHeight(tree.root);
System.out.println("Height of tree "+h);
int h1=tree.height(tree.root);
System.out.println("Height of tree "+h1);
// System.out.println("In-order");
// tree.printInOrder(tree.root);
// sc.close();
}
}