Suppose, in a triply linked list, the elements 2, 3, 3, 5, 5, 5 and 6 are inserted in the given sequence. To which of the following elements will the top pointer point, if the linked list is traversed starting from the head?

What is the time complexity of inserting an element at the beginning of a linked list?

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

Which of the following is a disadvantage of linked lists compared to arrays?

A. Dynamic size

B. Random access

C. Ease of insertion and deletion

D. Memory overhead

What is a circular linked list?

A. A list where each node points to the next

B. A list where the last node points to the first node

C. A list where each node points to itself

D. A list where the nodes are in a circle

Which of the following is true about a doubly linked list?

A. Each node has one pointer

B. Each node has two pointers

C. It is a type of tree

D. It can be traversed in one direction only