Subject map
Data Structures & Algorithms I
Trace searches, sorting, arrays, linked lists, stacks, queues, and deques operation by operation.
Binary Search
Shrink a sorted search range and predict every midpoint.
Resume trace โAvailable lessons
Binary Search
Shrink a sorted search range and predict every midpoint.
Sorting Arena
Compare Bubble, Selection, and Insertion Sort operation by operation.
Linked List Lab
Trace access, insertion, deletion, reversal, and cycle detection pointer by pointer.
Array & Dynamic Array Lab
Trace index arithmetic, shifting, resizing, and amortized growth slot by slot.
Stack Lab
Push, pop, peek, and search across fixed-array, dynamic-array, and linked backings.
Queue Lab
Compare naive-array shifting, circular wrap-around, and linked front/rear updates.
Deque Lab
Push, pop, and peek at both ends of a circular buffer or doubly linked list.
Hash Table Lab
Hash keys into buckets, chase collisions through chains and probes, and rehash on resize.
Search Lab
Race linear, binary (loop and recursion), BST, and hash search on the same data.
BST Lab
Search, insert, delete, traverse, and measure a binary search tree node by node.
Strings Lab
Trace character reads, copies, allocations, immutable growth, and builder capacity.
Recursion Lab
Trace call frames, base cases, unwinding, recurrence levels, and stack depth.