True/False Questions on Linked Structures and Iterators

1. In a linked stricture, nodes contain references to other nodes.

2. A list implementation using linked structures requires more memory than a list implementation as an array.

3. Since Python list methods are written in complied C code, using the Python list to write a program will always be faster than a linked list implemented in Python.

4. A class invariant is a set of properties that must be true before and after each method of a class is executed.

5. The worst case for the amount of time to insert at the beginning of an array-based list is the same as the amount of the time to insert at the end of a linked-based list.

6. The amount of time to insert at the beginning of a linked-based list is the same as the amount of time to insert at the end of a linked-based list if you have a link to the last node in the list.

7. You must write a next method to write an iterator in Python.

8. If an LList or built-in Python list contains only immutable objects, there is never a need to create a deep copy of the list instead of a shallow copy.

9. In Python, you must use the del statement when removing a node from a linked structure in order to deallocate the memory used by the node.