State what is meant by the term ‘dynamic data structure’
Consider the following circularly linked list
Given a new node containing the number 7 (called NEW_NODE) and a pointer (called PREV_NODE) which points to the node containing the number 8, describe how the new node should be added to the linked list in such a way that the circularly linked list remains both properly formed and sorted.
In contrast to the process described in part b), outline why it would be less efficient to add the value 32 to a static array containing [16, 8, 4] in such as way as to preserve both existing values and ascending order.
Extended Response6 MarksPremium
34 Uses64 Views3 Likes
Login or Create an Account to view the mark scheme, comment, and add to a test