Data Structure Viewer

Stack
Queue
Binary Search Tree
Hash Table
Push / Pop / Peek: O(1)
Operation Log
Enqueue / Dequeue / Peek: O(1)
← FrontRear →
Operation Log
Insert / Delete / Search: O(log n) avg, O(n) worst
Operation Log
Insert / Search: O(1) avg, O(n) worst (collision chain)
Operation Log
📚 Deep Dive
📦 Arrays: Contiguous Memory — DSA Ch.2 📚 Stacks: The Magic of LIFO — DSA Ch.5 🗂️ Hash Tables: The Cost of O(1) — DSA Ch.8 🌳 BSTs and Balanced Trees — DSA Ch.11

💬 Comments