SHSubjectHub

Trees and binary search trees

AQA 75174.2 L6A-levelLesson packSubscription
Also online

This worksheet marks itself

Set it as homework or classwork and every answer is marked as pupils go, with feedback on what they got wrong. The scores go straight into your mark book, so you can see who needs help before the next lesson.

  • 11 questions
  • 28 marks
  • about 35 minutes
  • marked instantly

Question types: short answer, multiple choice, matching, true or false.

Try it with a class, freeHow it works

Try one from this worksheet

Identify the statement that is true about the graph below.

Pick an answer: it's marked straight away, just as your pupils would see it.

About this resource

AQA A-level Computer Science (7517) 4.2.5.1 Trees (including binary trees) · 4.2.1.4 Abstract data types: trees. C# lesson 6 of 8 in 4.2 Fundamentals of data structures: a trace-the-matrix Do Now, a short key idea, an 11-challenge ladder in three sets with exact test data, two exam questions and…

17 slides.

Lesson outline

  1. Do Now: trace the adjacency matrix
  2. Do Now: answers
  3. Key idea: A tree is a graph with no cycles
  4. Key idea: A binary search tree, stored in arrays
  5. Key idea: Searching a binary search tree
  6. Key idea: Trees in C# without pointers, and uses
  7. Set 1: read a tree stored in arrays
  8. Set 2: insert, count and print in order
  9. Exam question E1: trees and rooted trees
  10. Model answer E1
  11. Exam question E2: insert into the arrays
  12. Model answer E2
Unit bundle4.2 Data structures · full C# lessons
Part of: 4.2 Data structures · full C# lessons: the whole unitEvery resource in the unit in one zip.

More from 4.2 Data structures · full C# lessons