Computer Science (AS & A Level) · Oct / Nov 2021 · Paper 42 · Question 3
9618
As printed in the paper
The question as text
An ordered binary tree stores integer data in ascending numerical order. The data for the binary tree is stored in a 2D array with the following structure: LeftPointer Data RightPointer Index [0] [1] [2] [0] 1 10 2 [1] -1 5 -1 [2] -1 16 -1 Each row in the table represents one node on the tree. The number -1 represents a null pointer.
Read automatically from the paper; the printed page above is exact.
Show the answer and mark scheme
3(a)[4]
3(b)[8]
3(c)[4]
3(d)(i)[3]
3(d)(ii)[1]
3(e)(i)[7]
3(e)(ii)[1]
Make a free account to save your answers and see your weak topics and ask the AI why a wrong answer is wrong.