Data structures

Home
Data structures

Overview

A data structure is a data organization, management, and storage format that enables efficient access and modification. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data.

Search

Stack

Data structure

A stack is an abstract data type that serves as a collection of elements, with two main principal operations:

push, which adds an element to the collection,
and pop, which removes the most recently added element

The order in which elements come off a stack gives rise to its alternative name, LIFO (last in, first out).

Linked list

Data structure

A linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a collection of nodes which together represent a sequence.
This structure allows for efficient insertion or removal of elements from any position in the sequence during iteration.

Doubly linked list

Data structure

A doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains three fields: two link fields (references to the previous and to the next node in the sequence of nodes) and one data field.
The two node links allow traversal of the list in either direction.

Hash table

Data structure

A hash table is a data structure that implements an associative array abstract data type, a structure that can map keys to values. A hash table uses a hash function to compute an index, also called a hash code, into an array of buckets or slots, from which the desired value can be found. During lookup, the key is hashed and the resulting hash indicates where the corresponding value is stored.