Goseeko blog

What is the Abstract data type in Data structure?

by Bhumika

The abstract data type is a form of data that has a set of values and actions that determine its behaviour. Because we can use various data types and execute multiple operations, the keyword “abstract” is employed. However, the user has no visibility into how such operations work. The ADT is formed up of basic data types, but the operation mechanism is hidden.

Furthermore, the user of a data type does not need to understand how that data type is implemented; for example, we have been utilising primitive values such as int, float, and char data types only on the basis that they can operate and be performed on without understanding how they are implemented. As a result, all a user needs to know about a data type is what it can accomplish, not how it will be implemented. Moreover, Consider ADT to be a black box that conceals the data type’s inner structure and design.

Operation of Abstract data type

These are a few operations or functions as follows :


  • isFull() – This is use to verify whether or not the stack is full.
  • isEmpty() – This use to evaluate if the stack is empty or not.
  • push (x) – This is use to place x at the top of the stack.
  • pop () – This method removes one element from the stack’s top.
  • peek () – This uses to get the highest element of the stack.
  • size () – This function is use to determine the number of elements in a stack.


  • replace() – A different element can be use to replace an element in any position.
  • get() – At any place in the list, return an element.
  • isEmpty() – Return true if the list is empty; otherwise, return false.
  • remove() – Remove the first occurrence of any element from a non-empty list.
  • isFull() – If the stack is full, return true; elsewhere, return false.
  • insert() – At any time, you can add a new element to the list.
  • size() – The list’s number of elements is return.


  • size() – The queue’s number of elements is return.
  • enqueue() – Add a new element to the queue’s end.
  • isFull() – Return true if the queue is full; otherwise, return false.
  • dequeue() – If the queue is not empty, remove the first entry and return it.
  • peek() – If the queue is not empty, return the element of the queue without removing it.
  • isEmpty() –  Return true if the queue is empty; otherwise, return false.

Interested in learning about similar topics? Here are a few hand-picked blogs for you!

  1. What is OSI model?
  2. Explain Cryptography?
  3. What is Concurrency?
  4. Describe Binary search tree?

You may also like