1. Core Data Structures and Operations

Memory layout, invariants, and implementation details for arrays, linked lists, stacks, queues, heaps, hash tables, binary search trees, and traversal operations.

8 items

1. Core data structures and operations

section name
1.1 Arrays and Dynamic Arrays
1.2 Linked Lists
1.3 Stacks
1.4 Queues and Deques
1.5 Heaps and Priority Queues
1.6 Hash Tables and Sets
1.7 Binary Search Trees
1.8 Basic Tree Traversals
Wiki › Algorithms › 02. Data Structures › 1. Core Data Structures and Operations ›

1.1 Arrays and Dynamic Arrays

Fixed and dynamic arrays, resizing strategies, memory layout, cache effects, vectorization, and in-place operations.
algorithms data-structures arrays
Wiki › Algorithms › 02. Data Structures › 1. Core Data Structures and Operations ›

1.2 Linked Lists

Singly, doubly, and circular linked lists with operations for insertion, reversal, cycle detection, sorting, and memory pooling.
algorithms data-structures linked-list
Wiki › Algorithms › 02. Data Structures › 1. Core Data Structures and Operations ›

1.3 Stacks

Array and linked stack implementations covering push, pop, monotonic stacks, expression evaluation, and thread-safe variants.
algorithms data-structures stack
Wiki › Algorithms › 02. Data Structures › 1. Core Data Structures and Operations ›

1.4 Queues and Deques

Array and linked queues, deques, monotonic queues, priority buckets, delay queues, and concurrent queue designs.
algorithms data-structures queue deque
Wiki › Algorithms › 02. Data Structures › 1. Core Data Structures and Operations ›

1.5 Heaps and Priority Queues

Binary, d-ary, Fibonacci, pairing, soft heaps, double-ended structures, tournament trees, and concurrent priority queue designs.
algorithms data-structures heap priority-queue
Wiki › Algorithms › 02. Data Structures › 1. Core Data Structures and Operations ›

1.6 Hash Tables and Sets

Hash functions, collision resolution strategies, open addressing, chaining, dynamic resizing, perfect hashing, concurrent maps, and probabilistic filters.
algorithms data-structures hash-table
Wiki › Algorithms › 02. Data Structures › 1. Core Data Structures and Operations ›

1.7 Binary Search Trees

BST operations, traversals, augmentation, interval trees, order statistics, persistence, and thread-safe BST designs.
algorithms data-structures bst trees
Wiki › Algorithms › 02. Data Structures › 1. Core Data Structures and Operations ›

1.8 Basic Tree Traversals and Operations

General tree traversal patterns including DFS, BFS, level-order, zigzag, boundary traversal, LCA, serialization, and iterative approaches.
algorithms data-structures trees traversal