Computer Science · Data Structures
एक दोहरी लिंक की गई सूची (doubly linked list) में, पूंछ (tail) से सिर (head) तक जाने के लिए किसकी आवश्यकता होती है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1किसी भी पॉइंटर की नहीं, क्योंकि यह एकदिशीय है
- 2केवल टेल (tail) पॉइंटर✓
- 3हेड और टेल दोनों पॉइंटर्स
- 4केवल हेड (head) पॉइंटर
सही उत्तर देखें
केवल टेल (tail) पॉइंटर
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