Computer Science · Data Structures
कौन सी डेटा संरचना खोज (search), प्रविष्टि (insertion) और विलोपन (deletion) संचालन के लिए O(1) की औसत समय जटिलता प्रदान करती है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1बाइनरी सर्च ट्री (Binary Search Tree)
- 2हैश टेबल (Hash Table)✓
- 3कतार (Queue)
- 4स्टैक (Stack)
सही उत्तर देखें
हैश टेबल (Hash Table)
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