Implicit data structure

An implicit data structure, also called a space-efficient data structure, stores little information beyond its main required data. Relationships between elements are represented by their positions, rather than by pointers that explicitly link elements. Definitions of low overhead vary, but it generally means constant overhead, expressed as O(1) in big O notation. A succinct data structure is a less restrictive category that permits greater overhead.

The picture on this card was made with AI. It is an illustration, not a real photo of the subject.

Also called

Space-efficient data structure

Element relationships

Carried by element positions

Typical overhead

Constant, O(1)