Computer Science · Data Structures
A data structure is required for storing a set of integers such that each of the following operations can be done in O(log n) time, where n is the number of elements in the set: 1. Deletion of the smallest element 2. Insertion of an element if it is not already present in the set Which of the following data structures can be used for this purpose?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A heap can be used but not a balanced binary search tree.
- 2A balanced binary search tree can be used but not a heap.✓
- 3Both balanced binary search tree and heap can be used.
- 4Neither balanced binary search tree nor heap can be used.
Correct answer
A balanced binary search tree can be used but not a 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