Linked List Quiz

Which of the following is NOT a basic type of linked list?

• Singly linked list

• Doubly linked list

• Triply linked list

• Circular linked list

In a singly linked list, each node contains:

• Data and two addresses

• Data and one address to the next node

• Only data

• Data and one address to the previous node

Why does a singly linked list take up less memory than a doubly linked list?

• It stores only data without addresses

• Each node has only one link instead of two

• It does not require a head node

• It uses static arrays instead of nodes

Which type of linked list allows traversal in both directions?

• Singly linked list

• Doubly linked list

• Circular singly linked list

• None of the above

What extra pointer is added in a doubly linked list compared to a singly linked list?

• Pointer to tail

• Pointer to previous node

• Pointer to head

• Pointer to null

Which of the following linked lists takes up more memory?

• Singly linked list

• Doubly linked list

• Both take the same memory

• None of the above

A circular linked list differs from a normal linked list in that:

• Nodes contain no data

• The last node links back to the first node

• It cannot be traversed

• It stores nodes in a stack

How do we usually detect the end of a singly linked list?

• When the pointer is null

• When the node points to the head

• When the node contains no data

• When the node index is 0

Which type of linked list requires more complex code to detect the start and end?

• Singly linked list

• Doubly linked list

• Circular linked list

• None of the above

Which linked list is best for continuously cycling through data?

• Singly linked list

• Doubly linked list

• Circular linked list

• None of the above