Cambridge A Level Computer Science 9618 – P4.09 Binary trees in code – Lesson & Worksheet

Cambridge A Level Computer Science 9618 – Section 19 Computational thinking and problem-solving (14

A complete, ready-to-teach bundle for **Cambridge International AS & A Level Computer Science (9618)**: Section 19 Computational thinking and problem-solving, in 14 bespoke lessons. Every lesson comes with: - **Editable PowerPoint slides**: goals, starter, explanations, diagrams, worked examples, a quick check, a task and an exit ticket, with teacher notes - **Student worksheet (Word)**: recall, applied practice and exam-style questions with marks - **Answer sheet (Word)**: full mark-scheme style answers Worth £69.86 if bought lesson by lesson. ## What's inside - **P4.01** Linear search in code - **P4.02** Binary search in code - **P4.03** Insertion sort in code - **P4.04** Bubble sort and comparing sorts - **P4.05** Stacks in code - **P4.06** Queues in code - **P4.07** Linked lists: find and insert - **P4.08** Linked lists: delete - **P4.09** Binary trees in code - **P4.10** Dictionaries and graphs as ADTs - **P4.11** Big O notation - **P4.12** Recursion - **P4.13** Writing and tracing recursion - **P4.14** Recursion, stacks and unwinding ## Why teachers use it - Mapped lesson by lesson to the syllabus, so coverage is easy to track - Cambridge pseudocode, as in the 2027–2029 pseudocode guide, with Python alongside - Fully editable: adapt to your class, timings and school template - Works for teaching, revision, cover lessons and homework These are independent resources written for the Cambridge International AS & A Level Computer Science syllabus (9618) for examination in 2027, 2028 and 2029. They are not produced or endorsed by Cambridge University Press & Assessment. Syllabus point numbers are our own numbering of the syllabus statements.