Circular Linked List Quiz

In a circular singly linked list, how do you detect the end of the list?

• When node.next == null

• When node == head

• When node.next == head

• When node.next == node

What is the main advantage of using circular linked list over linear linked list?

• Easier insertion at tail

• Less memory usage

• Random access

• Supports recursion

In a circular doubly linked list, the prev of head should point to...?

• null

• tail

• head

• head.next

Which of the following is true about inserting into a circular singly linked list at the end?

• You must update tail.next to point to null

• You must update tail.next to head

• You must update tail.next to newNode, and newNode.next to head

• You don’t need to update anything

A circular doubly linked list has 5 nodes. How many unique next and prev links exist in total?

• 5 next, 5 prev = 10

• 5 total

• 6

• Infinite loop

Which situation causes infinite loop in circular singly linked list traversal?

• while(node != null)

• while(node != head)

• while(node.next != null)

• while(true)

Which is a safe traversal condition for a circular singly linked list?

• while(temp != null)

• while(temp.next != head)

• do { … } while(temp != head)

• while(temp == head)

In a circular doubly linked list, which of the following is true?

• head.prev == null

• tail.next == head

• tail.next == null

• head.prev == tail.next

Insert at end of circular singly linked list

if (head == null) {    

    head = newNode;  

      newNode.next = _____; // Fill here     }

• null

• head

• newNode

• temp

Delete first node from circular singly linked list

void deleteFirst() {

  Node temp = head;    

while (temp.next != _____) { // Fill here    

    temp = temp.next;     }

• head

• temp

• newNode

• null