Login or Create an Account to view the mark scheme, comment, and add to a test
(a).
Explain why a binary tree is a dynamic data structure
[2]
(b).
Explain why a binary search tree is most suitable for maintaining a list of people’s surnames in such a way as to facilitate faster surname searching.
[2]
(c).
Draw a binary search tree with the following nodes added from left to right: Ohana, Cohen, Greenberg, Lee, Rich, Paul, Zion
[2]

Extended Response6 MarksShared
3 Uses18 Views0 Likes