C++ linked lists

In a linked list, each node contains a pointer to:

• The previous node

• The next node

• Both the previous and next nodes

• None of the other answers

Which of the following is an advantage of using a linked list over an array?

• Constant-time access to elements

• Easy to resize

• Cache-friendly

• All of the above

How do you add a new node to the end of a linked list?

• Set the next pointer of the last node to the new node

• Set the next pointer of the new node to the last node

• Set the previous pointer of the last node to the new node

• Set the previous pointer of the new node to the last node

Which of the following is a disadvantage of using a linked list?

• Requires more memory than an array

• Accessing elements is slower than an array

• Cannot be sorted

• All of the above

Which of the following is a characteristic of a doubly linked list?

• Each node has two pointers: one to the previous node and one to the next node

• Each node has one pointer to the next node

• Each node has one pointer to the next node

• None of the above

Which of the following is a characteristic of a circular linked list?

• The last node points to NULL

• The first node points to NULL

• The last node points to the first node

• The first node points to the last node

How do you delete a node from a linked list?

• Set the next pointer of the previous node to the next node

• Set the previous pointer of the next node to the previous node

• Set the next pointer of the current node to the previous node

• Set the previous pointer of the current node to the next node

What is the time complexity of searching for an element in a linked list?

• O(1)

• O(log n)

• O(n)

• O(n^2)

Which of the following is a common use case for linked lists?

• Storing a small number of elements

• Storing a large number of elements that require random access

• Storing a large number of elements that do not require random access

• None of the above