AQA A’Level SLR05 Tree traversal algorithms

About this video

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.

Last updated: 27.02.25

SLR 05 – Algorithms

AQA A’Level SLR05 Tree traversal algorithms

About this video

Other videos on this course

AQA A’Level SLR05 Binary search

AQA A’Level SLR05 Bubble sort

AQA A’Level SLR05 Dijkstra’s shortest path

AQA A’Level SLR05 Graphs traversal algorithms

AQA A’Level SLR05 Linear search