QUESTION 1 A circular linked list is a list in which Is an array O each node has a node coming after it. O Each node is linked to the node before it and the node after it O All nodes but the last have a node coming after it QUESTION 2 A doubly linked list is a list in which o each node has a node coming after it. O Is an array Each node is linked to the node before it and the node after it O All nodes but the last have a node coming after it QUESTION 3 Nodes for doubly linked lists require 3 pointers. O True False QUESTION 4 In a circular linked list, the last node in the list points to null. True O False QUESTION 5 A circular linked list allows you to be at any node in the list and traverse the entire list. True O False QUESTION 6 Allocating space for a new node in a circular linked list is the same as for a regular linked list. O True False QUESTION7 Circular linked lists are useful for applications that require constant time access to both ends of the list. O True False QUESTION 8 With a doubly linked list, traversing the list in reverse is as easy as forwards traversing the list. True False QUESTION9 In a doubly linked list, one of the pointers in the head node will always point to null O True False QUESTION 10 Performing a search on a doubly linked list is quicker than performing a search on a singly linked list. That is, the big Oefficiency is better on a doubly linked list than on a singly linked list. O True O False