Computer Science · Data Structures
You are given two sorted linked lists of lengths m and n, respectively. What is the optimal time complexity to merge them into a single sorted linked list?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(m + n)✓
- 2O(max(m, n))
- 3O(log (m+n))
- 4O(1)
Correct answer
O(m + n)
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