Bespoke, fully editable lesson for the new IB Diploma Computer Science syllabus (first assessment 2027): B4.1.4 Binary search trees. Slides, worksheet and full answers.
Written for the 2027 IB Computer Science guide, unit B4 Abstract data types (HL only). Everything is editable, so you can adapt it to your class.
What’s included- PowerPoint lesson (14 slides) with speaker notes on every slide
- Student worksheet (Word), ready to print or edit
- Answer sheet (Word) with model answers for every question
By the end of the lesson students can:
- Use tree terms and the BST rule to build a tree from a list of values
- Trace in-order, pre-order and post-order traversals and a search
- Insert and delete nodes, including a node with two children
Worksheet sections: A. Tree words; B. Build a tree; C. Traverse and search; D. Delete; E. Code it
Every lesson includes- Learning goals and a starter question
- Clear explanations with worked examples (Python where code is needed)
- A quick check and a “your turn” task linked to the worksheet
- An exit ticket
- PowerPoint (.pptx) and Word (.docx), fully editable
- Works in PowerPoint and Google Slides
- Calm pastel design, consistent across the whole IB course
These are independent resources written for the IB Diploma Programme Computer Science guide (first assessment 2027). They are not produced or endorsed by the International Baccalaureate Organization.
Get this resource as part of a bundle and save up to 33%
A bundle is a package of resources grouped together to teach a particular topic, or a series of lessons, in one place.
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.
£4.99