Part V · Trees, Priority Structures and Range Queries
25. Binary Search Trees and Ordered Sets
6 lessons•33 topics•Intermediate / Advanced
6 of 6 lessons published
25.016 animated
BST invariant
- Ordering rule
- Duplicates policy
- Search
- Minimum/maximum
- Successor
- Predecessor
25.024 animated
BST updates
- Insert
- Delete leaf
- Delete one-child
- Delete two-child
- Transplant
- Hibbard deletion intuition
25.036 animated
BST queries
- Floor/ceiling
- Lower/upper bound
- Kth smallest
- Rank
- Range sum
- Range traversal
25.044 animated
BST validation
- Validate BST with bounds
- Inorder sortedness
- Recover swapped nodes
- BST from preorder
25.054 animated
BST construction
- Sorted array to BST
- Balanced build
- Degenerate BST
- Height effects
- Random insertion trees
25.06Lesson
Ordered maps and sets
- TreeMap
- TreeSet
- NavigableMap
- NavigableSet
- Submaps
- Comparator semantics