Computer Science · Data Structures and Algorithms
एक बाइनरी ट्री का प्रतिनिधित्व करने वाले तत्वों के निम्नलिखित सरणी (array) पर विचार करें: 289, 219, 250, 217, 212, 215, 22, 25, 27, 211, 26, 29, 300। मानक हीपीफाई (heapify) एल्गोरिथ्म का उपयोग करके इस सरणी को मैक्स-हीप (max-heap) में बदलने के लिए आवश्यक विनिमयों (swaps) की न्यूनतम संख्या क्या है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 14
- 22
- 35
- 43✓
सही उत्तर देखें
3
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
Preparing for Computer Science?
Practice full-length Computer Science mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures and Algorithms MCQs →Want more practice questions on Data Structures and Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures and Algorithms