Big O

Data Structure Access, avg Search, avg Insert, avg Delete, avg Access, worst Search, worst Insert, worst Delete, worst Space, worst
Array Θ(1) Search, avg Insert, avg Delete, avg Access, worst Search, worst Insert, worst Delete, worst Space, worst
Stack Θ(N) Search, avg Insert, avg Delete, avg Access, worst Search, worst Insert, worst Delete, worst Space, worst
Queue Θ(N) Search, avg Insert, avg Delete, avg Access, worst Search, worst Insert, worst Delete, worst Space, worst
Singly-Linked List Θ(N) Search, avg Insert, avg Delete, avg Access, worst Search, worst Insert, worst Delete, worst Space, worst
Doubly-Linked List Θ(N) Search, avg Insert, avg Delete, avg Access, worst Search, worst Insert, worst Delete, worst Space, worst
Skip List Θ(log(N)) Search, avg Insert, avg Delete, avg Access, worst Search, worst Insert, worst Delete, worst Space, worst
Hash Table Access, avg Search, avg Insert, avg Delete, avg Access, worst Search, worst Insert, worst Delete, worst Space, worst
BST Access, avg Search, avg Insert, avg Delete, avg Access, worst Search, worst Insert, worst Delete, worst Space, worst
Cartesian Tree Access, avg Search, avg Insert, avg Delete, avg Access, worst Search, worst Insert, worst Delete, worst Space, worst
B-Tree Access, avg Search, avg Insert, avg Delete, avg Access, worst Search, worst Insert, worst Delete, worst Space, worst
Red-Black Tree Access, avg Search, avg Insert, avg Delete, avg Access, worst Search, worst Insert, worst Delete, worst Space, worst
Splay Tree Access, avg Search, avg Insert, avg Delete, avg Access, worst Search, worst Insert, worst Delete, worst Space, worst
AVL Tree Access, avg Search, avg Insert, avg Delete, avg Access, worst Search, worst Insert, worst Delete, worst Space, worst
KD Tree Access, avg Search, avg Insert, avg Delete, avg Access, worst Search, worst Insert, worst Delete, worst Space, worst