糖心Vlog

Please consent to cookies to view content.

' ); iframeDoc.close(); } } } } } const observer = new MutationObserver(switchSrc); observer.observe(document.documentElement, { childList: true, subtree: true, }); })();

糖心Vlog

Last updated

22 November 2026

zip, 1.86 KB
zip, 1.86 KB
zip, 3.72 KB
zip, 3.72 KB
pdf, 404.83 KB
pdf, 404.83 KB
pptx, 231.12 KB
pptx, 231.12 KB
pdf, 461.54 KB
pdf, 461.54 KB
pptx, 253.56 KB
pptx, 253.56 KB

Linked lists from first principles to full insert-and-delete algorithms, using one worked example that builds up through the whole lesson.

馃煝 Foundation (Grades E鈥揇): key terms, read a linked list from a table, trace a traversal.
馃煚 Core (Grades C鈥揃): linked lists vs arrays, delete a node and update the free list, write a search function.
馃煟 Stretch (Grades A鈥揂):* insert using the free list, follow pointers from any start, write a full delete algorithm.

Support built in: hints, sentence starters, step-by-step prompts, planning frames and success checklists.

What鈥檚 included

Teacher edition: 27 slides with timings, speaker notes and a full mark scheme
Student edition: no answers or notes
12 tiered tasks over four parts, plus a starter and an exit ticket
Python code pack: START files for students and tested solutions for teachers
PPTX (fully editable) and PDF

How to use it: teach it as one lesson, or split it, using the code part as homework. Suits AQA 7517 and OCR H446.

Independent resource, not affiliated with or endorsed by any exam board.

Reviews

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

to let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.