DSA
Visualizer
Home
Features
Reviews
About
About Us
Our Mission
FAQs
Quick answers to common questions about our platform
Services
Algorithm Visualizer
Step-by-step algorithm visualization
Learn CS Basics
Foundational programming concepts
Blogs
Tutorials & guides on development
Login/Signup
Home
Features
Reviews
About
About Us
Our Mission
FAQs
Quick answers to common questions about our platform
Services
Algorithm Visualizer
Step-by-step algorithm visualization
Learn CS Basics
Foundational programming concepts
Blogs
Tutorials & guides on development
Login/Signup
Dark Mode
Algorithm
Visualizer
Interactive visual representations of computer science concepts
Array
Searching
Linear Search
Binary Search
Sorting
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Stack
Operations
Push & Pop
Peek
Is Empty
Is Full
Polish Notations Evaluation
Postfix
Prefix
Implementation
Using Array
Using Linked List
Queue
Operations
Enqueue & Dequeue
Peek Front
Is Empty
Is Full
Types
Single Ended Queue
Double Ended Queue (Deque)
Circular Queue
Priority Queue
Multiple Queue
Implementation
Using Array
Using Linked List
Linked List
Types
Singly Linked List
Doubly Linked List
Circular Linked List
Operations
Traversal
Insertion
Deletion
Searching
Reverse
Merge
Comparison
Tree
Binary Tree
Structure & Properties
Types of Binary Trees
Binary Search Tree
Insertion
Deletion
Searching
Balancing (AVL)
Traversal
Pre-order
In-order
Post-order
Level-order (BFS)
Morris Traversal
Advanced Trees
Red-Black Trees
B-Trees
Trie (Prefix Tree)
Segment Trees
Fenwick Trees
Algorithms
Lowest Common Ancestor
Tree Diameter
Tree Isomorphism
Serialize/Deserialize
Applications
Heap Sort
Huffman Coding
Decision Trees
Syntax Trees
Graph
Representation
Adjacency Matrix
Adjacency List
Traversal
Breadth-First Search (BFS)
Depth-First Search (DFS)
Algorithms
Dijkstra's Algorithm
Prim's Algorithm
Kruskal's Algorithm
Topological Sort