Question

Binary search trees have their best performance when they are balanced, which means that at each node, n, the height of the left subtree of n is within 1 of the height of the right subtree of n. Write a function (and a test program) that takes a sorted list of entries and produces a balanced binary search tree.

EXPERT ANSWER

The algorithm for a function to create the BST from a