AQA A’Level SLR05 Tree traversal algorithms
About this video
AQA Specification Reference
A Level 4.3.2.1
In this video we take a look at a variety of algorithms which can be used to traverse a binary tree, these include: Pre-order, Post-order and In-order.
Key questions:
- How do you add a data item to a binary tree?
- How do you remove a data item from a binary tree?
- How do you traverse a binary tree using the following:
1. Pre-order traversal
2. Post-order traversal
3. In-order traversal
00:00 Tree traversal algorithms
00:13 Intro
00:18 A note about this video
00:35 Traversing, adding to and removing from a binary tree
01:12 Adding an item to a binary tree
03:16 Removing an item from a binary tree
08:56 Does it have to be this complicated?
09:55 Traversing a binary tree
10:27 Traversing a binary tree using pre-order traversal
11:36 Traversing a binary tree using in-order traversal
12:37 Traversing a binary tree using post-order traversal
13:33 Traversing a binary tree continued
13:37 Key questions
14:06 Essential algorithms and data structures text book
14:55 Outro
Last updated: 14.04.25
