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