Binary Search Tree & MapC++ · Templates · Recursion
LiveInsert a key
Binary search tree operations in motion Compare keys to follow left or right branches. Insert a new leaf, find an existing key, iterate in ascending order, or create a map entry and set its value. The tree does not rebalance.
  1. 01Compare keys
  2. 02Follow the branch
  3. 03Insert a leaf
  4. 04Keep keys ordered