Question Image
(a).
With respect to the binary search tree above, list all the nodes values according to the order in which they are visited by the following tree traversals.
(i).
In-order
[1]
(ii).
Pre-order
[1]
(iii).
Post-order
[1]
(b).
Describe how the post-order tree traversal algorithm works.
[3]
(c).
In contrast to arrays, outline two benefits of using binary search trees.
[4]
(d).
In contrast to a balanced binary search tree, identify one disadvantage of an unbalanced binary search tree;
[1]

Extended Response11 MarksPremium
33 Uses54 Views3 Likes
Login or Create an Account to view the mark scheme and add to a test