Which of the following is a disadvantage of singly linked list?
AAccessing an element in a singly linked list requires traversal from the head, making it
slower than arrays.
BDeletion operation at the beginning of the linked list is performed in O(1) time.
CInsertion operation at the beginning of the linked list is performed in O (1) time.
DLinked lists have a variable size.
Show answerHide answer
Correct answer: (A) Accessing an element in a singly linked list requires traversal from the head, making it
slower than arrays.
Explanation
To reach the k-th element in a singly linked list you must traverse from the head, O(n), whereas arrays allow direct access by index. O(1) insertion and deletion at the start and variable size are advantages.