Essential algorithms and data structures

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 200 page book?

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

  1. An overview of the algorithm or data structure
  2. Typical applications and uses
  3. Typical operations with each data structures
  4. The algorithm written in simple structured English
  5. The algorithm written in pseudocode
  6. Full code listing in Python
  7. Source code in Python, Visual Basic and C# are also available to download
  8. Walk-through of the algorithm
  9. Efficiency discussion with reference to Big-O notation

Registered in England and Wales: 10442992

VAT Number: 290 9845 58

Telephone: 03330 164 059

Email: admin@craigndave.co.uk

BETT Finalists 2022