Balanced BSTs - Overview

• Balance properties will ensure height is Θ (log n), n = Size()
• BST properties ensure that search algorithms work unchanged
• All const methods for BST carry over to the balanced tree cases
• Concentrate on the methods that require new implementations:
1. Insert
2. Get
3. Put
4. Recursive analogs of 1-3
• Erase for all BSTs