**A Level Computer Science: Trees**

This module contains:

##### Compatible with the following examination boards

### Download A Level Module 37: Trees

**This download is exclusively for Teach Computer Science subscribers!**

To download this file, click the button below to signup (it only takes a minute) and you'll be brought right back to this page to start the download!

Already a member? Log in to 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:

- 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: