A Level Computer Science: Trees
This module contains:
Compatible with the following examination boards
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:
- A node is distinguished as root.
- 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: