Implicit data structure

In computer science, an implicit data structure or space-efficient data structure is a Data structure that stores very little information other than the main or required data: a data structure that requires low overhead. They are called “implicit” because the position of the elements carries meaning and relationship between elements; this is contrasted with the use of pointers to give an explicit relationship between elements. Definitions of “low overhead” vary, but generally means constant overhead; in big O notation, O(1) overhead.

(“Implicit Data Structure” 2021)

Bibliography

Backlinks

• Binary heap
• Data structures