A circular linked list is a list in which

1		All nodes but the last have a node coming after it.
		Each node is linked to the node before it and the node after it
		each node has a node coming after it.
		Is an array

QUESTION 2

A doubly linked list is a list in which

		Is an array
		each node has a node coming after it.
		All nodes but the last have a node coming after it.
		Each node is linked to the node before it and the node after it

QUESTION 3

Nodes for doubly linked lists require 3 pointers.

True

False

QUESTION 4

In a circular linked list, the last node in the list points to null.

True

False

QUESTION 5

A circular linked list allows you to being at any node in the list and traverse the entire list.

True

False

QUESTION 6

Allocating space for a new node in a circular linked list is the same as for a regular linked list.

True

False

QUESTION 7

Circular linked lists are useful for applications that require access to both ends of the list.

True

False

QUESTION 8

With a doubly linked list, traversing the list in reverse is as easy as forwards traversing the list.

True

False

QUESTION 9

In a doubly linked list, one of the pointers in the head node will always point to null.

True

False

Performing a search on a doubly linked list is quicker than performing a search on a singly linked list. That is, the big O efficiency is better on a doubly linked list than on a singly linked list.

True

False