DSA Factory
Curriculum
Level 3 · Structures

Binary search trees

About 15 steps, from the first idea to a mastery test.

  1. Stage 0Search and insertFree
    1. 1Search a BST8 min
    2. 2Minimum value in BST7 min
    3. 3Insert into a BST8 min
    4. 4Closest value in BST9 min
  2. Stage 1Ordered walksFree
    1. 1Two values that add up14 min
    2. 2The next value up12 min
    3. 3Cut a tree down to a range14 min
    4. 4Add everything that is bigger14 min
  3. Stage 2Validate and repairFree
    1. 1Is it really a search tree14 min
    2. 2Two values got swapped20 min
    3. 3Remove a node and keep the order20 min
    4. 4Grow a tree one value at a time14 min
  4. Stage 3MasteryFree
    1. 1The k nearest values20 min
    2. 2Straighten the tree into a line18 min
    3. 3How many are smaller to the right26 min
Start freeTry a step first