1

In worst case, the number of comparison need to search a singly linked list of length n for a given element is

Correct Answer: n

Make the most of this question

This page focuses on one Data Structure and Algorithms (DSA) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

Data Structure and Algorithms (DSA) MCQ: In worst case, the number of comparison need to search a singly linked list of length n for a given element is | Extra Education