Data Structure Visualizations

data-structuresalgorithmsvisualizationeducationcs

Abstraction: Interactive visual demonstrations of classic CS data structures and algorithms

Key points:

Interactive visualization tool covering stacks, queues, lists (array and linked-list implementations), binary search trees, AVL trees, Red-Black trees, Splay trees, B-trees, B+ trees, tries, radix trees, and ternary search trees
Covers hashing: open and closed hash tables (open addressing and bucket variants)
Sorting algorithms visualized: bubble, selection, insertion, shell, merge, quick, bucket, counting, radix, heap sort
Graph algorithms: BFS, DFS, connected components, Dijkstra, Prim's MST, Kruskal, Floyd-Warshall, topological sort (two methods)
Also covers geometric algorithms (2D/3D rotation, scale, translation matrices) and disjoint sets/union-find
Some features (Huffman coding, some list implementations) available only in Java version

Connections: Data Structures · Algorithms · Sorting Algorithms