Linked List and Data Structures Quiz

What is a node in a singly linked list composed of?

• Data, previous pointer

• Data, next pointer

• Only data

• Only a pointer

Insertion at the beginning of a singly linked list takes:

• O(n) time

• O(1) time

• O(log n) time

• O(n²) time

What is the time complexity to insert an element at the end of a singly linked list (without a tail pointer)?

• O(1)

• O(n)

• O(log n)

• O(2n)

Which is an advantage of linked lists over arrays?

• Random access

• Fixed size

• Dynamic size adjustment

• Lower memory usage

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

• Insertion at the head

• Deletion of a node given its pointer

• Traversal in reverse

• Searching

What is the last node’s pointer set to in a circular linked list?

• Null

• Head node

• Tail node

• Random node

Which of the following is NOT a linked list type?

• Singly linked

• Doubly linked

• Circular linked

• Array-based linked

What is the time complexity to search for an element in a linked list?

• O(1)

• O(n)

• O(log n)

• O(n log n)

To reverse a singly linked list, you need to:

• Swap data of all nodes

• Reverse the direction of pointers

• Sort the list

• Delete alternate nodes

How do you find the middle element of a linked list in one pass?

• Use a stack

• Use two pointers (fast and slow)

• Count all nodes first

• Traverse backward