AQA A Level · Computer Science 7517

Tree-traversal: Practice Questions

5 multiple-choice questions marked as you go, and 5 written questions with worked solutions. All on Tree-traversal.

10 questions24 marksFree, no account

Question 1

1 mark

Which tree-traversal algorithm would be most appropriate to use if you wanted to create a complete copy of a binary tree structure?

Question 2

1 mark

Which of the following describes the correct sequence of operations for a pre-order traversal of a rooted binary tree?

Question 3

1 mark

A binary tree is traversed and produces the following outputs:
Pre-order: F, B, A, D, C, E, G, I, H
In-order: A, B, C, D, E, F, G, H, I

What is the post-order traversal of this tree?

Question 4

1 mark

When performing an in-order traversal on a binary search tree (BST) containing numeric values, in what order will the contents be processed?

Question 5

1 mark

Which of the following describes a scenario where post-order traversal is essential for the correct operation of an algorithm?

Question 6

2 marks

What is one specific practical application of performing a Pre-order traversal on a rooted tree structure?

Write your answer out first, then check it against the worked solution.

Question 7

3 marks

When performing an In-order traversal on a Binary Search Tree (BST) containing integer values, what is the characteristic property of the resulting output sequence?

Write your answer out first, then check it against the worked solution.

Question 8

5 marks

A binary tree is used to represent a file directory system. Which traversal method would be used to delete a directory only after all of its sub-directories and files have been deleted?

Write your answer out first, then check it against the worked solution.

Question 9

4 marks

A rooted tree is used to represent an arithmetic expression: \( (8 - 3) \times (4 + 2) \).

(a) Describe how an In-order traversal of this expression tree would look, including the placement of brackets.
(b) Perform a Post-order traversal on the tree and state the resulting sequence.
(c) Explain the relationship between the result of a post-order traversal and Reverse Polish Notation (RPN).

Write your answer out first, then check it against the worked solution.

Question 10

5 marks

Consider a binary search tree (BST) where nodes are traversed using different methods.

(a) List the steps for an In-order traversal.
(b) Explain why an In-order traversal is particularly useful for a BST compared to other trees.
(c) Describe a practical use for Pre-order traversal.

Write your answer out first, then check it against the worked solution.

* The content provided by thinka is generated by AI and may not always be accurate or up-to-date. Please use it as a supplementary resource and verify with official materials.

You've seen the model answer. Now get yours marked.

This page can show you how a good answer looks. It cannot tell you what your answer was missing. thinka marks your written work against the real mark scheme in about 15 seconds.

Get My Answers Marked Back to the notes

Want more questions like these? Get a fresh set on this topic, marked as you go.