Data Structures

Fundamental structures for organizing and storing data

Array Operations

Best:O(1)Avg:O(n)Space:O(1)

fundamentalrandom-access

Singly Linked List

Best:O(1)Avg:O(n)Space:O(n)

dynamicsequentialpointer

Stack

Best:O(1)Avg:O(1)Space:O(n)

LIFOsequentialrecursive

Queue

Best:O(1)Avg:O(1)Space:O(n)

FIFOsequentialscheduling

Binary Tree Traversals

Best:O(n)Avg:O(n)Space:O(h)

treehierarchicaltraversal

Binary Search Tree

Best:O(log n)Avg:O(log n)Space:O(n)

treehierarchicalorderedsearch

Hash Table

Best:O(1)Avg:O(1)Space:O(n)

hashkey-valueO(1)-lookup

Min-Heap

Best:O(1)Avg:O(log n)Space:O(n)

heappriority-queuecomplete-tree