Skip to content
Related Articles

Related Articles

Improve Article

GATE | GATE-CS-2003 | Question 63

  • Last Updated : 28 Jun, 2021

A data structure is required for storing a set of integers such that each of the following operations can be done in (log n) time, where n is the number of elements in the set.

   o    Delection of the smallest element 
   o    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?
(A) A heap can be used but not a balanced binary search tree
(B) A balanced binary search tree can be used but not a heap
(C) Both balanced binary search tree and heap can be used
(D) Neither balanced binary search tree nor heap can be used


Answer: (B)

Explanation:
First we’ll discuss about heap and balanced bst and its time complexities for basic operations like

insertion, deletion, find.

Heap:-

Let us consider it as min heap



1) Insertion: O(logn)

2) Delete Min: O(logn) (Just replace root with INT_MAX and heapify)

3) Find: O(n)

Balanced BST:-

1) Insertion: O(logn)

2) Delete Min: O(logn)

3) Find: O(logn)

Statement 1:

1) Deletion of smallest element can be done in O(logn) in both data structures

Statement 2:

1) Insertion of an element if it is not already present in the set

In heap, we can perform this operation in O(n) because we have to perform linear search here, where as in BST we can perform this in O(logn)

See Question 4 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-3/

 

This solution is contributed by Anil Saikrishna Devarasetty

Quiz of this Question

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :