1. 7.12.PASCAL
   1. 7.12.1. LINKED LISTS
      1. 7.12.1.1. INTRODUCTION TO LINKED LISTS
         1. 7.12.1.1.1. WAYS OF STORING INFORMATION
         2. 7.12.1.1.2. DESCRIPTION OF AN ARRAY
         3. 7.12.1.1.3. DESCRIPTION OF A LINKED LIST
         4. 7.12.1.1.4. THE DIFFERENCES BETWEEN AN ARRAY AND A LINKED LIST
         5. 7.12.1.1.5.CHARACTERISTICS OF LINKED LISTS
      2. 7.12.1.2. COMPONENTS OF A LINKED LIST
      3. 7.12.1.3. PASCAL CODE FOR NODES AND SPECIAL PASCAL MEMORY FUNCTIONS
      4. 7.12.1.4. DESCRIPTION OF A SINGLE NODE
      5. 7.12.1.5. INSERTING NODES
      6. 7.12.1.6. DELETING NODES
      7. 7.12.1.7. TRAVERSING THE LINKED LIST
      8. 7.12.1.8. TRAVERSING EXAMPLE: PRINTING OUT THE LIST
      9. 7.12.1.9. PROGRAMMING EXAMPLE
      10. 7.12.1.10. PROGRAM RUN