Category: Blog
-
How to Learn Minimum Spanning Trees: Cut Property, Kruskal, Prim and Proof of Choice
Learn minimum spanning trees from the cut property upward: spanning trees, greedy safety, Kruskal, Prim, Union-Find, priority queues, uniqueness and professional trade-offs.
-
How to Learn Topological Sorting: DAGs, Indegrees, Kahn’s Algorithm and Cycle Detection
Learn topological sorting from the dependency model upward: DAGs, indegrees, Kahn’s algorithm, DFS order, cycle detection, uniqueness and scheduling applications.
-
How to Learn Tries: Prefix Trees, Search, Autocomplete and Memory Trade-Offs
Learn tries from first principles: prefixes as shared paths, insert/search/delete, autocomplete, longest-prefix matching, complexity, memory trade-offs and professional design decisions.
-
How to Learn Backtracking Algorithms: Choose, Explore, Undo and Prune
A beginner-to-professional learning manual for recursive backtracking: model the state-space tree, choose and undo safely, prune impossible branches, test restoration invariants, and reason about exponential search.
-
How to Learn Balanced Search Trees: AVL, Red-Black Trees and Rotations
A beginner-to-professional learning manual for balanced search trees: understand why plain BSTs degenerate, learn rotations as invariant-preserving repairs, compare AVL and red-black balancing, and reason about worst-case guarantees.
-
How to Learn Binary Search Trees: Ordering Invariant, Search, Insert and Delete
A beginner-to-professional learning manual for binary search trees: reason from the ordering invariant, trace search and insertion, master deletion cases, diagnose degeneration, and connect structure to complexity.
