Abstract Data Type

In field of computer science, an abstract data type (ADT) can be defined as a mathematical model for a certain class of data structures that have similar behavior; or for certain data types of one or more programming languages that have similar semantics.

Encapsulation

Abstraction provides a promise that any implementation of the ADT has certain properties and abilities; knowing these is all that is required to make use of an ADT object. The user does not need any technical knowledge of how the implementation works to use the ADT. In this way, the implementation may be complex but will be encapsulated in a simple interface when it is actually used.

Localization of change

Code that uses an ADT object will not need to be edited if the implementation of the ADT is changed. Since any changes to the implementation must still comply with the interface, and since code using an ADT may only refer to properties and abilities specified in the interface, changes may be made to the implementation without requiring any changes in code where the ADT is used.

Flexibility

Different implementations of an ADT, having all the same properties and abilities, are equivalent and may be used somewhat interchangeably in code that uses the ADT.
 

Popular Stuff

Binary Search C program

Binary search algorithm is a technique for locating a particular value in a sorted list.

Creation Of Binary Search tree

Learn How to Create a BST

Simple Linked List

In computer science, a linked list is one of the fundamental data structures, and can be used to implement other data structures

Doubly Linked List

Doubly Linked List Implementation

Push and Pop in Linked list

Learn how to Push & Pop in a Linked List

Threaded Binary tree

A binary tree is threaded by making all right child pointers

---------------------------------------------------------------------------------------