Data Structures & Algorithms Visualizer

Interactive visualizations to help you understand complex algorithms and data structures

📊

Data Structure

Sorting Algorithms

Algorithms that put elements in a certain order, typically in numerical or lexicographical order.

Algorithms:

Bubble Sort
O(n²)O(1)
Selection Sort
O(n²)O(1)
Insertion Sort
O(n²)O(1)
Merge Sort
O(n log n)O(n)
Quick Sort
O(n log n)O(log n)
Heap Sort
O(n log n)O(1)

📚

Data Structure

Stack

A linear data structure that follows the Last-In-First-Out (LIFO) principle.

Operations:

Push
O(1)O(1)
Pop
O(1)O(1)
Peek
O(1)O(1)

🔄

Data Structure

Queue

A linear data structure that follows the First-In-First-Out (FIFO) principle.

Operations:

Enqueue
O(1)O(1)
Dequeue
O(1)O(1)
Peek
O(1)O(1)

🔗

Data Structure

Linked List

A linear data structure where elements are stored in nodes, each pointing to the next node.

Operations:

Insert (beginning)
O(1)O(1)
Insert (end)
O(n)O(1)
Delete
O(n)O(1)
Search
O(n)O(1)

🔄

Data Structure

Doubly Linked List

A linear data structure where each node contains data and pointers to both the next and previous nodes.

Operations:

Insert (beginning)
O(1)O(1)
Insert (end)
O(1)O(1)
Delete (any position)
O(1)O(1)
Search
O(n)O(1)
Reverse
O(n)O(1)

🌳

Data Structure

Tree Structures

Hierarchical data structures with a root value and subtrees of children with a parent node.

Types:

Binary Search TreeInsert, Delete, SearchO(log n) to O(n)
Binary TreeInsert, TraversalO(n)

🕸️

Data Structure

Graph

A non-linear data structure consisting of nodes and edges connecting these nodes.

Algorithms:

BFS
O(V + E)O(V)
DFS
O(V + E)O(V)

🔺

Data Structure

Heap

A specialized tree-based data structure that satisfies the heap property.

Operations:

Insert
O(log n)O(1)
Delete
O(log n)O(1)
Heapify
O(n)O(1)
Heap Sort
O(n log n)O(1)

Created for educational purposes. Need help? Click the assistant button in the bottom right.