Queries, insertion, deletion, modification, height, performance.
Understand the properties of binary search trees and how to apply them.
What is a binary search tree; querying, insertion, and deletion.
Textbook 13 pages
Provide four implementations of the Dynamic Set ADT and compare their performance.
Programming