Home
Data Structures
13 algorithms01B-Tree
treebalanced
O(log n)02B+ Tree
treebalanced
O(log n)03B* Tree
treebalanced
O(log n)04Extensible Hashing
hashdynamic
O(1)05Array Operations
fundamentalrandom-access
O(n)06Singly Linked List
dynamicsequential
O(n)07Doubly Linked List
dynamicsequential
O(n)08Stack
LIFOsequential
O(1)09Queue
FIFOsequential
O(1)10Binary Tree Traversals
treehierarchical
O(n)11Binary Search Tree
treehierarchical
O(log n)12Hash Table
hashkey-value
O(1)13Min-Heap
heappriority-queue
O(log n)