1. There are several differences between an array and a linked list. Fill in the blanks to complete the points below.
2. A linked list maintains the memory _________ of each item in the list by using a series of '_________' within the data structure.
3. A number of pointers are required, these are: (fill in the blanks for the below)
4. A linked list can be considered a recursive data structure because it has a recursive definition.
5. For the object orientated example below, fill in the blanks: Linked lists are made up of ______, where each node contains a r______ to the next node in the list. In addition, each node contains a unit of data called the ______.
6. Analyse the code below to explain what is happening in lines 14 and 15.
7. Lists are useful because they provide a way to assemble multiple objects into a single entity, sometimes called a collection. In this example, the first node of the list serves as ...
8. What is happening in the code below?
9. A node can refer back to an earlier node in the list, including itself. For example, in a list with two nodes, one may refer to itself: If we invoke print_list on this list, it will
10. There are two ways to modify a linked list.We can perform operations to add, remove, or reorder the nodes or ...