Some True/False Questions for linked structures and Iterators.

6. 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.

7. 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.

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

9. 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.