Question 1
A tree is one example of a data structure.
Give two characteristics of a tree data structure.
[2]
The following data is entered into a binary search tree.
22 13 5 36 55 14 8
Draw the binary search tree when the given data is entered in the order given.
[4]
Describe how a leaf node is deleted from a binary search tree.
[2]
Describe how a binary search tree can be searched for a value.
[4]
Identify the order that the nodes will be visited in a depth-first (post-order) traversal of this binary search tree.
[4]
Explain how backtracking is used in depth-first (post-order) traversals.
[2]