Build an Ordered Map on a BST

BST deletion and range queries

Challenge 2 of Indexes & StructuresIntermediate~60 min

Build an ordered map on an unbalanced binary search tree: insert and look up integer keys, walk them in sorted order, find the smallest and largest, delete any node, and answer range queries for all keys between two bounds.

5 steps

  1. 1Insert and Contains
  2. 2In-Order Traversal
  3. 3Min and Max
  4. 4Delete
  5. 5Range Query
Start step 1