Problem:
Sorted Linked List to Balanced BST
Given a Singly Linked List which has data members sorted in ascending order.
Construct a Balanced Binary Search Tree which has same data members as the given Linked List.

Solution:
– This algorithm first, creates leaves then internal nodes

Latest Source Code:
Github: SortedLinkedListToBalancedBST.java

Output:

 List: 1 2 3 4 5 6 7 
Binary Search Tree :
   4       
  / \   
 /   \  
 2   6   
/ \ / \ 
1 3 5 7