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