Computer Science · Data Structures
Which is the correct option for searching an item in a linked list? Statement-1: Searching an item in a given sorted or unsorted linked list is done by traversing the list using a pointer variable and comparing the item with the content of each node, one by one. Statement-2: A standard binary search algorithm cannot be efficiently applied to a singly sorted linked list, since there is no random access way of indexing the middle element in O(1) time.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Statement-1 is False and Statement-2 is False
- 2Statement-1 is True and Statement-2 is False
- 3Statement-1 is True and Statement-2 is True✓
- 4Statement-1 is False and Statement-2 is True
Correct answer
Statement-1 is True and Statement-2 is True
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures MCQs →Want more practice questions on Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures