Linked List Implementations Quiz

Singly linked list has how many pointers in each node?

• 1

• 0

• 3

• 2

What is the main advantage of a singly linked list?

• Allows for random access

• Requires less memory

• Requires more memory

• Easier to implement

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

• O(n^2)

• O(log n)

• O(n)

• O(1)

How do you traverse a singly linked list?

• Skip every other node while traversing the list.

• Traverse the list in a random order.

• Start from the tail node and move to the previous node until reaching the start of the list.

• Start from the head node and move to the next node until reaching the end of the list.

What is the time complexity to delete a node from the middle of a singly linked list?

• O(n)

• O(1)

• O(log n)

• O(n^2)

How many pointers are there in a node of a doubly linked list?

• 1

• 3

• 4

• 2

What is the main advantage of a doubly linked list?

• Allows for random access to elements

• Requires less memory than a singly linked list

• Allows for traversal in both forward and backward directions

• Easier to implement than a singly linked list

What is the time complexity to insert a node at the end of a doubly linked list?

• O(n)

• O(1)

• O(log n)

• O(n^2)

How do you traverse a doubly linked list?

• By jumping to a random node

• By reversing the order of the nodes

• By removing nodes from the list

• By moving to the next or previous node from the current node

What is the time complexity to delete a node from the end of a doubly linked list?

• O(1)

• O(n)

• O(n^2)

• O(log n)