DATA STRUCTURES:

DATA STRUCTURES:

1. The Array

   • All data items are the same data type, grouped by one identifier. Each item addressed using its index.

2. The List

   • use - good for holding data in an ordered manner.
   • Pointers - every node has a pointer locating the next node in the list. Last node has a null pointer.
   • features - can insert and remove any item from list.
   • disadvantage - complicated maintenance of pointers, if all you want to do is read the last or first node.
     • advantage - most flexible type of linear list.

3. The Stack

   • use - to control excecution of subroutines
   • feature - can insert and remove any item from list.
   • Last-in-first-out, only last item is accessible to programmer
   • pointers - only one pointer used, called the stack pointer, locates the last item in the stack.
   • disadvantage - stack overflow and stack underflow can cause the program to crash.

4. The Tree

5. The Queue