Exam 5: Linked Lists

In an ordered list, the header node at the beginning of the list typically contains a value smaller than the smallest value in the data set.

Building a linked list backwards places the new item to be added at the end of the linked list.

In general, there are three types of linked lists-sorted, unsorted and mixed.

In a doubly linked list, every node contains the address of the next node except for the ____ node.

To delete a given item from an ordered linked list, there is no need to search the list to see whether the item to be deleted is in the list.

The link component of each node is a pointer.

The algorithms to implement the operations search, insert, and remove are the same for sorted and unsorted lists.

The order of the nodes in a linked list is determined by the data value stored in each node.

In the STL container list, the function push_front adds an element at the beginning of the list.

In the STL container list, the function pop_front ____.

____ lists have elements that are in no particular order.

Header and trailer nodes are considered part of a linked list.

Searching through a linked list or inserting an item in a linked list requires a ____ of the list.

____ lists have elements that are arranged according to some criteria.

A doubly linked list can be traversed in ____ direction.

The header node is placed at the ____ of a list.

The address of the first node in a linked list is stored in a separate location, called the head.

____ is a basic operation of the linked list ADT.

A linked list is a random access data structure such as an array.

In a linked list, we always want head to point to the ____ node.