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

Writing generic ajax function in javascript using jquery

In most of the application where frameworks like AngularJS/ React are not being used and simply made with javascript and Jquery, It is important to make use of reusable and generic components which will make things easier for the developer and maintenance. Advantages: A common set of functionalities can be applied to the ajax function call instead of… Continue reading Writing generic ajax function in javascript using jquery

Implementing Unique Visitor Count on website or webApp.

PS: Since I have upgraded my website and hosted on GitHub, I have changed the platform from Java to simple HTML. It’s no longer dynamic on my current site. One fine day, I thought of capturing the unique visitor count and displaying on website/ web app (www.vdharam.com). How is it possible to achieve in the best possible… Continue reading Implementing Unique Visitor Count on website or webApp.