Part 3 | Search Trees

• Objectives
• To read
• Exercises A
  • SequentialSearchST vs. BinarySearchST
  • Interpolation Search
  • Software Caching in BinarySearchST
  • Validating a Binary Search Tree
  • Valid BST Search Key Sequences
  • Validating a Red-Black BST
  • Enumerating BST Keys in Ascending Order
  • BST vs. 2-3 Tree Insertion Trace
  • Identifying Valid Red-Black BSTs
  • MCQ on Tree Traversals
  • BST Iterator
  • Ceil
  • Higher Key
  • MCQ on BST Time Complexity
  • Red-Black Tree Insertions
  • Red-Black Tree Conversion
• Exercises B
  • True/False: Binary Search, BSTs, and Red-Black Trees
  • Sorting with a BST
  • BST Deletion Complexity
  • Commutativity of BST Deletion
  • BST Serialization
  • BirthdayMap
  • Skyline
  • Array BST, Put and Get
  • Array BST, Delete