Discover published sets by community

A hierarchical data structure with a root value and subtrees of children, with a parent-child relationship. Used in databases, file systems.

A collection of items stored at contiguous memory locations. Used when elements are accessed by index and size of the dataset is known.

A linear collection of data elements called nodes, where each node points to the next node. Used when insertion and deletion operations dominate.

A collection of nodes connected by edges. Can represent physical and abstract systems, used in networks, relational data models.

A linear data structure following First-In-First-Out (FIFO). Used in scenarios requiring a fair queuing model like CPU scheduling.

A linear data structure following Last-In-First-Out (LIFO). Used for managing function calls, undo mechanisms in applications.

A binary tree where each node has a comparable key. Used for efficient searching, inserting, and deleting of data.

A special Tree-based data structure that satisfies the heap property. Used in implementing priority queues and for efficient sorting (Heap Sort).

Stores data in an associative manner. Used for fast data retrieval through unique keys, useful in database indexing.