Computer Science · May / June 2021 · Paper 1 HL · Question 11
IBCS
As printed in the paper
The question as text
11. Sketch a balanced binary tree that would allow the following output when traversed using inorder traversal: Zebra, Tango, Hotel, Foxtrot, Delta, Bravo, Alpha. [3]
Read automatically from the paper; the printed page above is exact.
Show the answer and mark scheme
Make a free account to save your answers and see your weak topics and ask the AI why a wrong answer is wrong.