Implementing Binary Search Tree: Insertion

Binary Search Tree(BST) is a standard data structure which is very useful in case of searching because of O(log n) complexity in the worst case. This post is the solution of the HackerRank challenge Binary Search Tree: Insertion. Let us see the different implementations of the same problem. Please note these implementations are in java language. Solution By Recursion:… Continue reading Implementing Binary Search Tree: Insertion