A linear data structure operating on a Last-In, First-Out (LIFO) basis, where elements are appended and popped from the same end.

A hierarchical, non-linear data structure consisting of nodes connected by edges, with a single root and no cycles.

A linear data structure operating on a First-In, First-Out (FIFO) basis, where new elements are added to the rear and existing elements are removed from the front.

A collection of data fields of varying types grouped together under a single identifier, where each field is accessed by its own name.