Computer Science · Data Structures
n नोड्स वाली एक सिंगली लिंक्ड लिस्ट (singly linked list) में, यदि हमारे पास हेड पॉइंटर (head pointer) की एक्सेस हो, तो शुरुआत में एक नया नोड डालने की समय जटिलता (time complexity) क्या होगी?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(n2)
- 2O(log n)
- 3O(n)
- 4O(1)✓
सही उत्तर देखें
O(1)
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