4,339 views

1 Answer

Best answer
9 votes
9 votes
The deletion of a random node would take $O(n+log(n))$ as first we will find where the random element is in the heap which will take $O(n)$ and then delete it which will further take $O(log(n))$
selected by

Related questions

0 votes
0 votes
1 answer
1
Shashank Chavan asked Dec 18, 2015
510 views
Is it possible to delete intermediate node/number in Heap? Not a root or last.
4 votes
4 votes
1 answer
2
Gaurab Ghosh asked Jan 18, 2017
1,490 views
If you are given a sorted list with n elements in ascending order. Then what will be the Time complexity to build a Min heap from the given array?
8 votes
8 votes
3 answers
3
Kapil asked Sep 4, 2016
3,885 views
In a min-heap with n elements1). The 7th smallest element can be found in time, if duplicates are allowed ?2). The 7th distinct smallest element can be found in time, I...
1 votes
1 votes
1 answer
4