Lecture Synopsis

8. Binary Search Trees (cont'd)

• Dynamic Set Operations
  • Search
  • Max, Min
  • Predecessor, Successor
  • Insertion
  • Deletion
• Performance