Project Roadmap

A look ahead at the algorithms and data structures coming next to DSA Viz.

Stacks and Queues

Complete
  • ▹Stack: Last In, First Out (LIFO) structure
  • ▹Queue: First In, First Out (FIFO) structure
  • ▹Priority Queue: Queue where elements are dequeued based on priority
  • ▹Deque (Double-Ended Queue): Elements added/removed from both ends
Expected: Q4 2024

Sorting Algorithms

Complete
  • ▹Bubble Sort
  • ▹Selection Sort
  • ▹Insertion Sort
  • ▹Merge Sort
  • ▹Quick Sort
  • ▹Heap Sort
  • ▹Counting Sort
  • ▹Radix Sort
  • ▹Bucket Sort
Expected: Q1 2025

Searching Algorithms

Complete
  • ▹Linear Search
  • ▹Binary Search
  • ▹Depth-First Search (DFS) In Graph visualizer
  • ▹Breadth-First Search (BFS) In Graph visualizer
Expected: Q2 2025

Trees

Complete
  • ▹Binary Tree: COMPLETED
  • ▹Binary Search Tree (BST). COMPLETED
  • ▹AVL Tree: Self-balancing binary search tree. COMPLETED
  • ▹Red-Black Tree: Self-balancing BST. COMPLETED
  • ▹Heap: Complete binary tree for priority queues. COMPLETED
  • ▹Trie: Efficient retrieval of keys in strings. Coming Soon!
  • ▹Segment Tree: Range query problems. Coming Soon!
Expected: Q1 2025

Graphs

Complete
  • ▹Graph: Nodes (vertices) and edges. COMPLETED
  • ▹Directed and Undirected Graphs. COMPLETED
  • ▹Weighted Graph: Edges have weights. Coming Soon!
  • ▹Adjacency Matrix & List representations. Coming Soon!
Expected: Q2 2025

Hashing

Complete
  • ▹Hash Table: Mapping keys to values
  • ▹Hash Map: Associative array implementation
  • ▹Hash Set: Collection of unique elements
Expected: Q3 2025

Advanced Algorithms

Complete

Dynamic Programming

  • Fibonacci Sequence
  • Knapsack Problem
  • Longest Common Subsequence
  • + more

Greedy Algorithms

  • Huffman Coding
  • Dijkstra’s Algorithm
  • Kruskal’s & Prim’s Algorithm

Backtracking

  • N-Queens Problem
  • Sudoku Solver
  • Hamiltonian Path

String Algorithms

  • Rabin-Karp Algorithm
  • KMP Algorithm
  • Boyer-Moore Algorithm
Expected: Q4 2025