Essential algorithms for GCSE and A Level Computer Science

Higher order data structures

Supported by some programming languages within the command set, programmers often implement these structures using the fundamental data structures as building blocks.

What is a linked list?

A linked list is a data structure that provides a foundation upon which other data structures can be built such as stacks, queues, graphs and trees.  A linked list is constructed from nodes and pointers.  A start pointer identifies the first node.  Each node contains data and a pointer to the next node in the linked list.  Many programming languages support lists in addition to arrays. 

Data in lists can be stored anywhere in memory, with pointers indicating the address of the next item in the structure.

Linked list videos

What extra is in the book?

This algorithm / data structure has its own dedicated chapter in the book, which includes:

  1. Overview
  2. Typical applications / uses
  3. Typical operations
  4. The algorithm written out in simple-structured English
  5. The algorithm written out in pseudocode
  6. Full code listing Python
  7. Full code listing in Visual Basic
  8. Diagrammatic walk-through
  9. Efficiency discussion with reference to Big-O notation

A hard copy of the book is available on our shop and a free PDF copy is included for all premium subscribers.