Linked List Quiz

What is the main difference between a singly linked list and a doubly linked list?

• Singly linked list has two pointers per node; doubly linked list has one

• Singly linked list has one pointer per node; doubly linked list has two

• Both have one pointer per node

• Both have two pointers per node

In a singly linked list, what does the 'Next' pointer of the last node point to?

• The first node

• NULL (or None)

• The previous node

• It points to itself

Which operation is easier to perform in a doubly linked list compared to a singly linked list?

• Insert at the beginning

• Traverse forward

• Traverse backward

• Find the middle element

In a doubly linked list, what happens when you delete a node?

• You only need to update the next pointer of the previous node

• You only need to update the previous pointer of the next node

• You need to update both next pointer of previous node and previous pointer of next node

• No pointers need updating

What is the time complexity to insert a node at the beginning of a singly linked list?

• O(1)

• O(n)

• O(log n)

• O(n^2)

What will be the output of the following Java code that traverses a singly linked list?

• 10 -> 20 -> 30 -> null

• 30 -> 20 -> 10 -> null

• null -> 10 -> 20 -> 30

• 10 20 30 null

What will be the output of this code that deletes the first node in a singly linked list?

• 1 2 3

• 2 3

• 3

• Null pointer exception

What is the output of this Java code snippet for searching a value in a singly linked list?

• true false

• false true

• true true

• false false

Which diagram correctly represents a doubly linked list node?

• [Data | Next] ->

• [Data | Prev]

• [Next | Data] ->

What happens when a new node is inserted at the front of a singly linked list?

• New node’s next points to the old head, new node becomes head

• New node’s next points to null

• Old head points to new node

• Nothing changes