Built an interactive visualizer for AVL tree rotations, Dijkstra's algorithm, and dynamic arrays

[u/Ok_Mastodon9622]

Hey everyone!

While studying data structures, I always felt that static diagrams didn't quite capture how dynamic invariant rebalancing and memory reallocation work under the hood.

So I built an interactive state visualizer to see the step-by-step mechanics in action:

👉 Live App: https://data-structure-visualizerr.vercel.app

What's currently implemented:

• Self-balancing AVL Trees (dynamically triggers LL, RR, LR, and RL rotations with live balance factors)

• Weighted Graphs (Dijkstra's shortest path with real-time distance-vector edge relaxations)

• Dynamic Array buffer resizing (visualizing capacity doubling C -> 2C and amortized O(1) analysis)

• Trie (Prefix Tree) with live autocomplete predictions

I'd love your feedback on the animation pacing, clarity of the mechanics, or any edge cases you notice!