Linked List Quiz

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

• O(n)

• O(1)

• O(log n)

• O(n log n)

In a doubly linked list (DLL), each node contains:

• Data and one pointer

• Only data

• Data and two pointers

• Data, one pointer, and a flag

What is the key disadvantage of singly linked lists over doubly linked lists?

• Higher memory usage

• Cannot traverse backwards

• More complex insertion

• Slower forward traversal

What is the correct way to delete a node in a doubly linked list?

• Adjust only the next pointer

• Adjust only the previous pointer

• Adjust both next and previous pointers of neighboring nodes

• Just set the node to NULL

Which of the following is TRUE about circular linked lists?

• The last node points to NULL

• They can only be singly linked

• The last node points to the head

• They cannot store integers

Which operation is generally more efficient in a doubly linked list compared to a singly linked list?

• Insertion at the beginning

• Traversal in forward direction

• Deletion of a given node

• Searching an element

What will be the time complexity to search for an element in a singly or doubly linked list (unsorted)?

• O(1)

• O(log n)

• O(n)

• O(n log n)

Which of these is an advantage of a singly linked list over a doubly linked list?

• Easier to implement

• Requires less memory per node

• Supports backward traversal

• Faster deletion

What is the initial value of the prev pointer in the head node of a doubly linked list?

• NULL

• Head

• Tail

• -1

What is the condition to detect the end of a singly linked list?

• When next pointer is NULL

• When data is 0

• When head equals tail

• When memory is full