ADT

An Abstract Data Type (ADT) is a way to define a data structure by specifying what it does, not how it does it. It describes the operations you can perform, like adding, removing, or accessing items, without detailing the underlying implementation. This allows programmers to focus on using the data structure for solving problems, while the specific method of storing and managing data can vary (e.g., arrays, linked lists). ADTs promote modularity, making code easier to understand, maintain, and adapt to different needs or performance requirements. Examples include stacks, queues, and lists.