Question: Which of the following operations on a linked list has a time complexity of O(n)?
Options:
Insertion at head
Insertion at tail
Deletion from head
Searching for an element
Correct Answer: Searching for an element
Solution:
Searching for an element in a linked list requires traversing the list, which takes O(n) time.
Which of the following operations on a linked list has a time complexity of O(n)
Practice Questions
Q1
Which of the following operations on a linked list has a time complexity of O(n)?
Insertion at head
Insertion at tail
Deletion from head
Searching for an element
Questions & Step-by-Step Solutions
Which of the following operations on a linked list has a time complexity of O(n)?
Step 1: Understand what a linked list is. A linked list is a data structure where each element (node) points to the next one.
Step 2: Know that to find an element in a linked list, you have to start from the first node and check each node one by one.
Step 3: Realize that if the linked list has 'n' nodes, in the worst case, you may have to check all 'n' nodes to find the element or determine it is not there.
Step 4: Conclude that this process of checking each node takes time proportional to the number of nodes, which is O(n).
No concepts available.
Soulshift Feedback×
On a scale of 0–10, how likely are you to recommend
The Soulshift Academy?
