‹ Back to the paper

Question 12(b)(ii)
1 mark
Computer ScienceISC 2018 Computer Science Paper 1Short answerData structures
Answer the following questions from the binary tree.
State the height of the tree, if the root is at level 0 (zero).

Answer
Answer
Checked answer.
A is at level 0; E and B at level 1; G, C and D at level 2; H and F at level 3. The deepest nodes are at level 3, so the height of the tree is 3.