Physical data structure

1. Array 는 Stack과 Heap에서 둘다 만들수 있다.
2. Linked List는 heap에서 만든다.

Logical data structure

• Linear data sturcture
  1. Stack (LIFO)
  2. Queue (FIFO)
• Non-Linear
  1. trees
  2. Graph
• Table
  1. Hash table

Abstract Data type

1. what is ADT(Abstract Data Type)
   • representation of data
   • int, float, double … - operation on data.
   • +,-,*,/,%,++,–

Example

• List -> 8,3,9,4,6,10,12

• Data :
  1. space for storing element(Array, Linked list)
  2. capacity
  3. size
• operation :
  • add(x)
  • remove()
  • search(key)
  • insert(key)
  • set(index, key)
  • replace(index, key)
  • get(index)
  • contain(key)