Binary Search Tree : Insertion HackerRank Solution

Binary Search Tree : Insertion HackerRank Solution
Source : https://www.hackerrank.com/challenges/binary-search-tree-insertion

You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree.You just have to complete the function.

Input Format

You are given a function,

Node * insert (Node * root ,int data) {}

Constraints

• No. of nodes in the tree 500

Output Format

Return the root of the binary search tree after inserting the value into the tree.

Sample Input

        4       / \      2   7     / \    1   3

The value to be inserted is 6.

Sample Output

         4       /   \      2     7     / \   /    1   3 6

Source : https://www.hackerrank.com/challenges/binary-search-tree-insertion

Solution

	// Karthikalapati.blogspot.com
	/* Node is defined as :
	class Node {
	int data;
	Node left;
	Node right;
	}
	*/
	// Runtime: O(log n) on a balanced tree.
	// Space Complexity: O(1)
	static Node Insert(Node root, int value) {
	/* Create new Node */
	Node newNode = new Node();
	newNode.data = value;
	/* Special case: empty tree */
	if (root == null) {
	return newNode;
	}
	/* Iteratively walk tree and insert new Node */
	Node curr = root;
	while (true) {
	if (value <= curr.data) {
	if (curr.left == null) {
	curr.left = newNode;
	return root;
	} else {
	curr = curr.left;
	}
	} else {
	if (curr.right == null) {
	curr.right = newNode;
	return root;
	} else {
	curr = curr.right;
	}
	}
	}
	}