What is a data structure in computer science?

A data structure is a specialized format for organizing, processing, retrieving, and storing data efficiently in a computer. It serves as the physical implementation of a data type, defining how data is represented in memory along with the functions or operations used to manipulate it. Different structures, ranging from simple arrays to complex linked nodes and persistent formats, are chosen based on the access patterns and performance requirements of an application.

What we know

• A data structure is a way to organize and store data that is chosen for efficient access. [3]
• A data structure is the physical implementation of a data type, including specifications of data organization, storage format, and operations. [3]
• A persistent data structure always preserves the previous version of itself when modified, making it effectively immutable. [4]
• A linked data structure consists of data records or nodes linked together and organized by references or pointers rather than pointer arithmetic. [5]

Where to go next

• compared withHow do abstract data types differ from data structures?
• a case in pointWhat is a persistent data structure?
• how it workedHow do linked data structures use pointers?
• whoWho introduced persistent data structures?
• the bigger pictureWhat are the core concepts of computer science?
• an unexpected connectionWhy are persistent data structures common in functional programming?Functional programming languages discourage or fully forbid mutable data, making persistent data structures that yield new updated structures essential.

Sources

• [1]List of data structures (Wikidata Q494950) · CC0 1.0
• [2]List of data structures · CC BY-SA 4.0
• [3]Data structure · CC BY-SA 4.0
• [4]Persistent data structure · CC BY-SA 4.0
• [5]Linked data structure · CC BY-SA 4.0