Data Structure Visualizer

When learning data structures in our computer science classes, we had to undergo the arduous task of drawing out the data structures with pen and paper with every insertion and deletion. This took a lot of unnecessary time, so we built the Data Structure Visualizer to fix that!

This app features both trees and weighted graphs. The trees you can currently choose from are:

-Binary Search Trees

-Red Black Trees

- AVL Trees

The trees offer the functionality of inserting and deleting nodes with corresponding animations. All actions are accompanied by a readout at the bottom of the screen explaining what the algorithm is doing. The user can also perform the following traversals on the trees:

- In-Order

- Pre-Order

- Post-Order

- Breadth-First

- Value Search

As for weighted graphs, the user can choose from pre-made graphs of the following types:

- Directed Arbitrary

- Directed Cyclical

- Directed Forest

- Undirected Arbitrary

- Undirected Cyclical

- Undirected Forest

The following traversals and algorithms can be performed on the graphs:

- Prim's MST

- Dijkstra's Shortest Path

- Breadth-First Path

- Kruskal's MST

Along with the tree and graph animations, the app offers a comprehensive guide to the tree and graph algorithms for reference; found by clicking the information icon.

This application was made in coordination with the University of Wisconsin-Madison CS 400 syllabus under the guidance of Professor Gary Dahl. It was developed by Samuel Gronseth, Milan Tomic, Joseph Polk, Allison Winter-Reed, Samraaj Thackeray, and Jessica Miyake.