xxxxxxxxxx
An abstract data type is a type with associated operations,
but whose representation is hidden
source: wiki.haskell.org
xxxxxxxxxx
An abstract data type (ADT) is a data type described by PREDEFINED user operations, such as "insert data at rear," WITHOUT indicating HOW each operation is implemented.
The "Class" supporrts the ADT construct.
For example, think of a car, where the steering wheel and the pedals
are the INTERFACE, and the engine and the wheels are the implementation.
The driver doesnt need to know the innner workings of the
vehicle (6 cylinder or 4 cylinder, etc) in order to use
the steering wheel and pedals in order to drive.
xxxxxxxxxx
Abstract Data type (ADT) is a type (or class) for objects whose behaviour is
defined by a set of value and a set of operations.
The definition of ADT only mentions what operations are to be performed
but not how these operations will be implemented.
xxxxxxxxxx
Abstract Data type (ADT) is a type (or class) for objects whose behaviour is
defined by a set of value and a set of operations.
The definition of ADT only mentions what operations are to be performed
but not how these operations will be implemented
xxxxxxxxxx
Stack
Queue
Deque
Priority Queue
Tree
These data types can be implemented in many different ways