Abstract Data Type

Abstract Data Type

1. has a dynamic data structure

   • Examples are
     • Queues
     • Linked List
     • Stacks
       • Operates under the LIFO structure (Last In First Out)
       • Arrays
       • Pointer
       • Integer
       • Two basic operations
         • POP
           • is removing an item from the top of the stack
             • causes pointer value to decrease
           • is possible either if stack is FULL or stack contains some data
         • PUSH
           • is adding a new item to the top of the stack
             • causes pointer value to increase
           • is possible either if stack is EMPTY or stack contains some empty spaces
     • Trees
   • Has ability to efficiently add, remove or modify elements and has a flexible size
   • Has risk of overflow and underflow
     • Harder to program as the software needs to keep track of its size and data item location all the time
     • Can be slow to implement searches