Computer Science · Data Structures
निम्नलिखित में से किस डेटा संरचना का उपयोग करके एक प्राथमिकता कतार (priority queue) को सबसे कुशलता से लागू किया जा सकता है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1FIFO संरचना वाली एक साधारण सरणी
- 2यादृच्छिक पहुंच (random access) वाली एक लिंक की गई सूची
- 3एक बाइनरी हीप (binary heap)✓
- 4LIFO संरचना वाला एक स्टैक
सही उत्तर देखें
एक बाइनरी हीप (binary heap)
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