Intro

A data structure is a way of organizing data in memory so that it can be accessed and modified efficiently. Data Structures implement ADTs.

Abstract Data Types (ADT)

An Abstract Data Type describes what operations are allowed, but not how they are implemented. An ADT defines:

• A set of values
• A set of operations
• The behavioral rules (semantics) of those operations

Common Abstract Data Types

• List
• Stack
• Queue
• Set
• Tuple

Data Structures

A data structure is the concrete implementation of an ADT. For a single ADT, there can be multiple different data structures that implement it, each with its own trade-offs in time and space efficiency.

Quote

A data structure is the concrete implementation that makes an ADT’s operations work. It specifies memory layout, pointer relationships, and the algorithms that execute each operation.

https://www.dataannotation.tech/developers/abstract-data-type-vs-data-structure?

• Linked List