# What Is Abstract Data Type in Data Structure With Example?

//

Scott Campbell

In the field of data structures, an abstract data type (ADT) refers to a high-level description of a data type that defines the behavior and properties of the data, without specifying implementation details. It provides a logical representation of the data and the operations that can be performed on it. The abstract data type serves as a blueprint for creating instances or objects of that type.

## Understanding Abstract Data Types

An abstract data type defines a set of operations that can be performed on the data, along with their expected behavior. These operations are typically categorized into two types:

1. Constructor Operations: These operations are used to create and initialize instances of the abstract data type.
2. Accessor Operations: These operations allow us to access or retrieve information from the instances created using the abstract data type.

The most commonly used abstract data types include:

• Stacks: A stack is an ADT that follows the Last-In-First-Out (LIFO) principle, where elements are added and removed from one end called the top.
• Queues: A queue is an ADT that follows the First-In-First-Out (FIFO) principle, where elements are added at one end called rear and removed from another end called front.
• Lists: A list is an ADT that represents an ordered collection of elements. It allows for dynamic size allocation and efficient insertion/deletion at any position.
• Trees: A tree is an ADT composed of nodes connected by edges.

It has a hierarchical structure with a root node at the top and child nodes branching out from it.

• Graphs: A graph is an ADT consisting of a set of vertices connected by edges. It is used to represent relationships between data elements.

## Example of Abstract Data Type

Let’s consider the abstract data type Stack. It can be defined with the following constructor and accessor operations:

### Constructor Operations:

• CreateStack(): Creates an empty stack.
• Push(element): Adds an element to the top of the stack.
• Pop(): Removes and returns the element from the top of the stack.

### Accessor Operations:

• Top(): Returns the element at the top of the stack without removing it.
• IsEmpty(): Checks if the stack is empty or not. Returns true if empty, false otherwise.

An implementation of a stack using arrays or linked lists can be created based on this abstract data type. The choice of implementation depends on factors such as memory efficiency, time complexity, and specific requirements of the application.

To summarize, abstract data types provide a way to describe and organize data in a structured manner. They hide implementation details and focus on defining operations that can be performed on the data. By understanding abstract data types, programmers can design efficient algorithms and solve complex problems more effectively.