Data structures visualizer

Visualization

Here you can visualize the behavior of some of the most common data structures. You can create new instances, perform operations on them and see how they change in real time.

Some operations are available on all data structures, like Search. Others may see their behaviour altered (for example a List may `insert` but a Queue will only `insert-last`). The operations displayed on the menu will correspond to the selected data types

Important: This does not show all posible data types, their use, and combinations. The structures you'll be tested on may vary or include different fields and operations, not showcased here. This is merely a visual aid for the course, to help understand why we choose certain structures over others, and how they work.

Abstract Data Types

Abstract Data Types (ADTs) are a way to define a data structure in terms of the operations that can be performed on it, without specifying how these operations are implemented. This allows for a clear separation between the interface and the implementation of the data structure.

Important: This does not show all possible ADTs/CDTs (or their implementations), only part of the underlying data structures.

This project is open source and available on GitHub. Feel free to contribute or report issues

See this page in: Español

Created as a visual aid for the Imperative Programming course at ITBA (72.31).