Day 22: Binary Search Trees HackerRank Solution

Day 22: Binary Search Trees HackerRank Solution
Source : https://www.hackerrank.com/challenges/30-binary-search-trees

Objective
Today, we're working with Binary Search Trees (BSTs). Check out the Tutorial tab for learning materials and an instructional video!

Task
The height of a binary search tree is the number of edges between the tree's root and its furthest leaf. You are given a pointer, , pointing to the root of a binary search tree. Complete the getHeight function provided in your editor so that it returns the height of the binary search tree.

Input Format

The locked stub code in your editor reads the following inputs and assembles them into a binary search tree:
The first line contains an integer, , denoting the number of nodes in the tree.
Each of the subsequent lines contains an integer, , denoting the value of an element that must be added to the BST.

Output Format

The locked stub code in your editor will print the integer returned by your getHeight function denoting the height of the BST.

Sample Input

7
3
5
2
1
4
6
7

Sample Output

3

Explanation

The input forms the following BST:

The longest root-to-leaf path is shown below:

There are nodes in this path that are connected by edges, meaning our BST's . Thus, we print as our answer.

Source : https://www.hackerrank.com/challenges/30-binary-search-trees

Solution

	// Karthikalapati.blogspot.com
	import java.util.*;
	import java.io.*;
	class Node {
	Node left, right;
	int data;
	Node(int data) {
	this.data = data;
	left = right = null;
	}
	}
	class Solution {
	/* We define a 1-Node tree to have height of 0 */
	public static int getHeight(Node root) {
	if (root == null) {
	return -1;
	} else {
	return 1 + Math.max(getHeight(root.left), getHeight(root.right));
	}
	}
	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);
	}
	int height = getHeight(root);
	System.out.println(height);
	}
	}