Computer Science · May / June 2023 · Paper 1 TZ1 HL · Question 8
IBCS
As printed in the paper
The question as text
8. Consider the following binary tree, in which each node stores a value greater than all the values in the node’s left subtree and less than those in its right subtree. F B E G C A D
Read automatically from the paper; the printed page above is exact.
Show the answer and mark scheme
8(a)[1]
8(b)[1]
8(c)[3]
Make a free account to save your answers and see your weak topics and ask the AI why a wrong answer is wrong.