Fixed-size collection of elements with contiguous memory allocation.
Linear data structure with nodes connected by pointers.
LIFO (Last In, First Out) data structure with push and pop operations.
FIFO (First In, First Out) data structure with enqueue and dequeue operations.
Key-value pairs with O(1) average time complexity for operations.
Hierarchical data structure with nodes and edges, no cycles.
Binary tree with left child < parent < right child property.
Complete binary tree with heap property (min or max heap).
Vertices and edges, can be directed or undirected, weighted or unweighted.
Tree-like data structure for storing strings, efficient for prefix searches.
Tree data structure for range queries and updates in O(log n).
Binary Indexed Tree for efficient prefix sum queries and updates.
Divide and conquer algorithm with O(n log n) average case.
Stable sorting algorithm with guaranteed O(n log n) time complexity.
In-place sorting using heap data structure, O(n log n) time complexity.
Simple comparison-based algorithm, O(n²) time complexity.
Efficient for small datasets, O(n²) worst case, O(n) best case.
Finds minimum element and swaps, O(n²) time complexity.