#data-structures
Read more stories on Hashnode
Articles with this tag
MAP DESCRIPTION: A container that represents an associative array of key-value pairs. Allows efficient retrieval of values based on their associated...
SET DESCRIPTION: A container that represents a sorted set of unique elements. Ensures that the elements are stored in sorted order according to the...
DESCRIPTION A container that represents a priority queue, implementing a binary heap to maintain elements in a specific order (max heap or min...
DESCRIPTION A container that follows the First-In-First-Out (FIFO) principle, where the first element added is the first one to be removed. Provides...
DESCRIPTION A container that follows the Last-In-First-Out (LIFO) principle, where the last element added is the first one to be removed. Provides a...
DESCRIPTION: Doubly linked list that supports efficient insertion and deletion at any position. Resembles a vector but with constant time complexity...
