Login or Create an Account to view the mark scheme, comment, and add to a test
![Question Image](https://res.cloudinary.com/n7-education/image/upload/v1647968317/user-content/261b3d92-2258-47f6-9232-e6ef72154f43/cb615ff2-9d33-4fb0-a5e8-84f2ab6b9204.jpg)
(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
41 Uses129 Views3 Likes