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.
What extra is in the book?
This algorithm / data structure has its own dedicated chapter in the book, which includes:
A hard copy of the book is available on our shop and a free PDF copy is included for all premium subscribers.