Learning Experience
Binary Search Trees
A tree that keeps every left descendant smaller and every right descendant larger, giving O(log n) search, insert, and delete when balanced.
Computer ScienceIntermediate9 min readdata-structurestreessearching
Before you start
Your learning journey
Every module Axiom offers for binary search trees — work through them in order, or jump to what you need.
TopicLiveUp next
Explains the BST invariant, the three delete cases, and balanced-vs-degenerate trees.
VisualizerLive
Animates insert, balanced build, search, and delete on a live tree the learner can regenerate.
QuizLive
Tests the two-children delete case, the operation learners most often get wrong.
AI TutorLive
Fields questions on traversals, balancing, and AVL/red-black follow-ons.
Cheat SheetLive
Quick recall of the invariant, delete strategy, and traversal orders.
Related concepts
Graph Traversal (BFS & DFS)
Two ways to visit every reachable node in a graph — breadth-first spreads outward level by level, depth-first commits to one path and backtracks.
Heaps & Priority Queues
A complete binary tree, stored flat in an array, that keeps the smallest (or largest) element one O(log n) extraction away — the standard way to build a priority queue.