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.

In-order

Pre-order

Post-order

Describe how the post-order tree traversal algorithm works.

In contrast to arrays, outline two benefits of using binary search trees.

In contrast to a balanced binary search tree, identify one disadvantage of an unbalanced binary search tree;