Vidyalelo
Data Structure · Q44

Linked Lists in Data Structures

Programming · Data Structure · question 44

Q44

Which of the following operations is most efficient in a singly linked list?

A.
Deletion from the end
B.
Accessing the middle element
C.
Insertion at the beginning
Answer
D.
Deletion from the beginning

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board