Sorting methods visualized.
Dijkstra, Bellman-Ford, BFS, and A* visualized.
LIFO, Call Stacks.
FIFO, circular buffer vs linked.
Double-ended queue
Singly/Doubly; pointer visualizer.
Hashset/Hashmap, Chaining vs open addressing.
N-ary trees with arbitrary arity per node.
BST basics, operations, traversals
Red-Black Trees & AVL Trees.
Prefix tree for strings
Min/Max-heap operations.
Adjacency list/matrix + traversals.