Classes 15 and 16 introduce the concepts of Binary Search Trees. We will examine the
BST operations and look at their worst-case and average case asymptotic analysis.
This class with lay the ground work for upcoming discussions of Splay trees and AVL trees.