-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinarySearchTree.java
57 lines (51 loc) · 1.3 KB
/
BinarySearchTree.java
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
// https://www.hackerrank.com/challenges/30-binary-search-trees
import java.util.Scanner;
class Node{
Node left,right;
int data;
Node(int data){
this.data=data;
left=right=null;
}
}
public class BinarySearchTree {
public static int getHeight(Node root){
//Write your code here
if (root == null) {
return -1;
} else {
int lh = getHeight(root.left);
int rh = getHeight(root.right);
return 1 + Math.max(lh, rh);
}
}
public static Node insert(Node root,int data){
if(root==null){
return new Node(data);
}
else{
Node cur;
if(data<=root.data){
cur=insert(root.left,data);
root.left=cur;
}
else{
cur=insert(root.right,data);
root.right=cur;
}
return root;
}
}
public static void main(String args[]){
Scanner sc=new Scanner(System.in);
int T=sc.nextInt();
Node root=null;
while(T-->0){
int data=sc.nextInt();
root=insert(root,data);
}
sc.close();
int height=getHeight(root);
System.out.println(height);
}
}