visualizers

Data Structure Visualisers

A collection of interactive data structure and algorithm visualisations built with vanilla JavaScript, HTML, and CSS.

Overview

This project provides a visual playground to understand how various data structures and algorithms work. Each visualiser is a self-contained web app with interactive controls.

Available Visualisers

Linear Structures

• Stack Visualiser
• Queue Visualiser
• Deque Visualiser
• Linked List Visualiser
• Priority Queue Visualiser

Trees

• Binary Search Tree (BST)
• AVL Tree
• Red-Black Tree
• B-Tree
• Heap
• Trie
• Segment Tree
• Fenwick Tree
• Disjoint Set

Algorithms

• Sorting Algorithms
• Graph Traversal (BFS/DFS)
• Pathfinding (Dijkstra/A*)
• Backtracking (N-Queens)
• Dynamic Programming (Knapsack)
• String Matching (KMP)
• Recursion Tree
• Hash Table
• Convex Hull (Graham Scan)
• LRU Cache
• Binary Search

How to Run

1. Open index.html in your web browser to view the main hub.
2. Navigate to any visualiser to start exploring.