Linked Lists

In Python we use lists rather arrays. Although, for our purpose they are one in the same. A node (element) in a linked list contains two fields:

  • Data (of any data type)
  • A pointer that points to the next element in the list
  • We could introduce a ‘previous’ field into the node but we shall just focus on the fore-mentioned fields.

    Also, we must keep track of the size of the list and a pointer that holds the position of the beginning of the list.

    Further reading:

  • Wikipedia – linked lists
  • Tutorials – linked lists
  • We shall build

    What we should know?

    From Higher we should be comfortable with the following:

    What we are going to learn (Software Development):

    Data Structures

    Complex Standard Algorithms

    • Sorting Algorithms
    • Binary Search Algorithm
    • Reading and Writing to a Database

    Object Oriented Programming

    What we are going to learn (Information Systems):

    Deisign Methodololgies

    • Data Dictionary
    • Wire Framing
    • Iterative Programming

    Web Authoring

    • Interactive User Interface
    • Database Driven
    • Mulitple Database Operations

    The Project