#databases
Read more stories on Hashnode
Articles with this tag
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: Double-ended queue that supports efficient insertion and deletion at both ends. Resembles a vector but provides constant time...
