Improving the Search Time with Binary Search Trees

The important concept to understand the BST is that ideally at each step in the algorithm that number of nodes that have to be considered has been cut in half. With an ideally arrangd BST the midpoint is the root. We than traverse down the tree, navigating to the left and right children as needed. These approaches cut the search space in half at each step. Such algorithms that exhibit this property have an asymptotic running time of log2n,