50% Black Friday SALE! Click here to lock in and save 50% for life!

Trees A Level Resources

A Level Computer Science: Trees

This module contains:

  • An editable PowerPoint lesson presentation
  • Editable revision handouts
  • A glossary which covers the key terminologies of the module
  • Topic mindmaps for visualising the key concepts
  • Printable flashcards to help students engage active recall
  • A quiz with answer key to test knowledge and understanding of the module
Compatible with the following examination boards
Trees A Level Resources Image 1
Trees A Level Resources Image 2
Trees A Level Resources Image 3
Trees A Level Resources Image 4
Trees A Level Resources Image 5

Download →

Trees

A tree is a non-linear data structure, where the nodes are connected by a directed edge. A tree consists of a root node and one or more sub-trees. The general properties of a tree are:

  1. A node is distinguished as root.
  2. Every node apart from the tree is connected to another node by a directed edge. The edge is directed from parent node to child node.

This A Level Computer Science module introduces trees to your students, explaining:

  • Trees and types of trees
  • Implementing binary search trees in programming
  • Traversing trees

More Data types, data structures and algorithms Modules

Trees is one lesson in our Data types, data structures and algorithms module. The other theory lessons can be found below: