This is a must have for all Computer Science A Level teachers.
This is an easy to understand Binary Search Trees 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
Something went wrong, please try again later.
This resource hasn't been reviewed yet
To ensure quality for our reviews, only customers who have purchased this resource can review it
Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.
£2.00