How many pointers are needed to build a linked list in a backward manner?
Every node (except of the last node) in a singly linked list contains ____.
a. the address of the previous node
b. the address of the next node
c. no address information
d. the next node
The length of a linked list is the number of nodes in the list.
In a doubly linked list, item insertion requires updating four pointers in certain nodes.
Linked lists allow you to overcome the size limitations of an array data type.
In a linked list, the address of the first node in the list is stored in a separate location, called the ____ or first.
Which of the following is a basic operation on singly linked lists?
a. Make a copy of the linked list
b. Determine whether the list is full
c. Swap the head and the last nodes
d. Retrieve the data of an arbitrary node
Each node of a singly linked list has two components: ____ and ____.
a. info; head
b. link; back
c. back; head
d. info; link
Building a linked list forward requires exactly two pointers.
Every node in a doubly linked list has two pointers: ____ and ____.
a. current; next
b. previous; next
c. back; next
d. previous; current
Memory for the components of an array does not need to be contiguous.
Data can be organized and processed sequentially using an array, called a(n) ____ list.
What is the purpose of the following code?
current = head;
while (current != NULL)
current = current->link;
a. Insertion of a node
b. Traversal of a linked list
c. Selection of a node
d. Creation of a new list
Suppose that the pointer head points to the first node in the list, and the link of the last node is NULL. The first node of the linked list contains the address of the ____ node.
To insert an item into a linked list, the address in each node must be changed.
When you build a linked list in the backward manner, a new node is always inserted at the end of the linked list.
You can use the pointer head of a linked list to traverse the list.
In a linked list, if a new item is always inserted in the beginning or in the end of the list and the data we read is unsorted, the linked list will be unsorted.
The statement p->link = p->link->link; removes a node from the linked list and deallocates the memory.
In a doubly linked list, the function search returns true if searchItem is found in the list.