Which of the following operations is NOT efficient for a linked list?

Practice Questions

1 question
Q1
Which of the following operations is NOT efficient for a linked list?
  1. Insertion at head
  2. Insertion at tail
  3. Accessing an element by index
  4. Deletion of a node

Questions & Step-by-step Solutions

1 item
Q
Q: Which of the following operations is NOT efficient for a linked list?
Solution: Accessing an element by index in a linked list requires O(n) time, as it must traverse the list from the head.
Steps: 0

Related Questions

Soulshift Feedback ×

On a scale of 0–10, how likely are you to recommend The Soulshift Academy?

Not likely Very likely