NIELIT Scientific Assistant June 2025 | Question: 107

Question

Which of the following operations can be performed in $\mathrm{O}(\log n)$ time in a binary heap?

• A. Deleting the root element
• B. Inserting an element
• C. Both $\text{(A)}$ and $\text{(B)}$
• D. Searching for an element

Answer 1

In A Binary Heap, 

Deleted a root element takes O(1), But to re-adjust other nodes according to the rules takes O(Logn).

Inserting in a Binary Heap takes O(logn ) as the element inserted might have to be bubbled all the way till the Binary heap's height which is Logn.

For searching in a Binary heap, It is not possible within Logn time as it doesnot follow any relation between  other nodes or subtrees but only with immediate children and parent. So it will take O(n) time.

So answer is option C, Both A and B.