FREE Binary Tree Traversal Sample | AQA A Level Computer Science 7517 | 2 Worksheets + Answers

Two free sample worksheets on binary tree traversal for AQA A Level Computer
Science (7517), with full answer keys, so you can see exactly what the full
pack contains before buying anything.

Each sheet gives a binary tree as a diagram and as a table of nodes - Index,
Left, Data, Right, with -1 for a missing child, the way AQA writes trees in
its own papers. Question 1 asks for all three traversals, question 2 for the
structure, and question 3 shows a recursive subroutine and asks which
traversal it performs and what stops it calling itself.

Neither tree has a traversal that comes out in alphabetical order, and no two
of the three traversals are the same, so a student cannot arrive at a correct
answer without actually walking the tree.

These two sheets are not in the paid pack - they are extra, so nothing is
wasted if you buy it afterwards.

The full pack contains 20 worksheets and 20 answer keys, every one built on a
different tree, and no two trees have the same shape. Search Tes for “AQA A
Level Computer Science binary tree traversal” to find it.

If these are useful, a review is genuinely appreciated - it is the only way
other teachers find resources like this.