This is an easy to understand Binary Search Tree presentation with video to aid retention and student test sheet with teacher answer sheet.
This presentation details the following:
- Depth First Algorithms
- Pre-order Traversal
- In-order traversal
- Post-order traversal
- Uses of traversals
Binary Search Trees Year 13 - A Level WJEC
£2.00Price
Resource Information
The student test is taken from a past paper WJEC A2 question for Unit 3.