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 binary tree?

A binary tree is a data structure consisting of nodes and pointers.  It is a special case of a graph where each node can only have zero, one or two pointers.  Each pointer connects to a different node.The first node is known as the root node.  The connected nodes are known as child nodes, while the nodes at the very bottom of the structure are referred to as leaf nodes.

Binary Tree 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.