Linear collection of elements stored in contiguous memory locations
Time: O(1) access, O(n) searchSpace: O(n)
LIFO (Last In, First Out) data structure
Time: O(1) all operationsSpace: O(n)
FIFO (First In, First Out) data structure
Time: O(1) all operationsSpace: O(n)
Linear data structure with nodes containing data and pointers
Time: O(n) search, O(1) insert/deleteSpace: O(n)
Hierarchical structure where each node has at most two children
Time: O(log n) balanced, O(n) worstSpace: O(n)
Binary tree with ordered property for efficient searching
Time: O(log n) average, O(n) worstSpace: O(n)
Complete binary tree with heap property for priority operations
Time: O(log n) insert/extract, O(1) peekSpace: O(n)
Tree for answering range queries and updates efficiently
Time: O(log n) query/updateSpace: O(n)
Binary Indexed Tree for prefix sum queries and updates
Time: O(log n) all operationsSpace: O(n)
Union-Find data structure for tracking disjoint sets
Time: O(α(n)) amortizedSpace: O(n)
DFS and BFS algorithms for exploring graph structures
Time: O(V + E) both algorithmsSpace: O(V)
Key-value pairs with hash function for fast access
Time: O(1) average, O(n) worstSpace: O(n)