Constructing a balanced Binary Search Tree from a sorted List in O(N) time
This post discusses a O(n) algorithm that construct a balanced binary search tree (BST) from a sorted list. For instance, consider that we are given a sorted list: [1,2,3,4,