Computer Science · Data Structures
यदि एक सिंबल टेबल को एक संतुलित खोज वृक्ष (balanced search tree) के रूप में लागू किया जाता है, तो n नाम दर्ज करने और m खोज करने के लिए आवश्यक अपेक्षित समय किसके समानुपाती होता है?
- 1mn log2 m
- 2mn log2 n
- 3(n + m) log2 m
- 4(n + m) log2 n✓
सही उत्तर देखें
(n + m) log2 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!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
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