Examveda

Which among the following is the time complexity for inserting at the beginning of a triply linked list?

A. O(n)

B. O(1)

C. O(log n)

D. O(n2)

Answer: Option B


This Question Belongs to Data Structure >> Linked Lists In Data Structures

Join The Discussion

Related Questions on Linked Lists in Data Structures

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