Binary Search Trees in Python | Cambridge A-Level 9618 CS | PPT + Worksheets + Activity + MCQ - CS

Binary Search Trees in Python | Cambridge A-Level 9618 CS | PPT + Worksheets + Activity + MCQ + Marking Scheme - Complete Lesson Package.

Algorithms Implemented in Python

Topic Covered.

• Trees & Binary Search Trees
• TreeNode class implementation
• Inserting into a BST
• Searching a BST recursively
• Pre-order, in-order, post-order traversal
• Deleting nodes from BST
• Visualising tree operations step-by-step

Save hours of lesson planning with this fully resourced, exam-aligned lesson pack on Binary Search Trees in Python

What’s included:
• PowerPoint presentationstep-by-step explanations with diagrams and animations
• Student worksheet with Binary Search Trees in Python structured questions
• Classroom activity [individual / pair / group] task
• Binary Search Trees in Python-question MCQ quiz with answer key
• Full marking scheme with examiner tips

Aligned with:
• Cambridge IGCSE Computer Science 0478 / 0984
• Cambridge AS & A-Level Computer Science 9618
• Grade [9 ,10 / 11 ]

Suggested lesson time: [60 / 90] minutes
All worksheets are print-ready
Fully editable resources.

Great for: classroom teaching, revision lessons, flipped learning, homework tasks

If you found this useful, please leave a review. it really helps!

Check out my other resources and bundles in my TES shop.