Data_structures terms
The right container makes every algorithm faster
Choosing the right data structure is often the difference between an algorithm that runs in milliseconds and one that times out. This category covers arrays, linked lists, trees, graphs, heaps, hash tables, and more complex structures — with focus on when to use each, what operations are fast or slow, and how they underpin the algorithms built on top of them.
Queues PHP 5.3+ A FIFO (First In, First Out) data structure — the first element enqueued is the first dequeued. Used for BFS traversal, job queues, rate limiting, and buffer management.
2mo ago
data_structures beginner
Stacks PHP 5.3+ A LIFO (Last In, First Out) data structure — the last element pushed is the first popped. Used for function call stacks, undo history, expression parsing, and DFS traversal.
2mo ago
data_structures beginner
Arrays PHP 5.0+
The most fundamental data structure — a contiguous block of memory holding elements of the same type, offering O(1) index access but O(n) insertion and deletion in the middle.
2mo ago
data_structures beginner
Linked List PHP 5.3+ A linear data structure where elements (nodes) store a value and a pointer to the next node, enabling O(1) insertion and deletion at known positions.
2mo ago
data_structures beginner