Exam 4: Arrays and Linked Structures

Inserting data at the beginning of a linked structure uses constant time and memory.

The insertion and removal of the first node of a singly linked structure require that the head pointer be reset.

When an array is instantiated, it is filled with zeros by default.

How does the class definition of a doubly linked structure differ from a singly linked structure?

In a doubly linked structure, the first and last item have an empty link.

When an array object is traversed in a for loop, the object's __iter__ method is called.

A linked structure can have items that have a maximum of one link to another item.

If an array's logical size is greater than zero, the index of the last item in the array is the logical size plus 1.

What does the last item in a singly linked structure contain?

Time performance is improved if you double the size of the array when you need to increase its size.