**A Level Computer Science: Algorithms for main data structures**

This module contains:

##### Compatible with the following examination boards

### Download A Level Module 55: Algorithms for main data structures

**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.

**Algorithms for main data structures**

Algorithms for data structures such as linked lists, stacks, queues, graphs, hash tables, and trees were described in previous topics. In this topic, we will learn in detail about the implementation of graph traversal algorithms. There are two ways of traversing a graph: depth-first search and breadth-first search.

This A Level Computer Science module introduces algorithms for main data structures to your students, explaining:

- Depth-first traversal algorithm for graphs
- Breadth-first traversal algorithm for graphs

**More Algorithms Modules**

Algorithms for main data structures is one lesson in our Algorithms module. The other theory lessons can be found below: