Register

min heap

• retagged by
16,034 views
32 votes
32 votes
The number of binary min. heaps that can be formed from a set of 7 distinct integers is _________?
• retagged by
User Avatar

5 Answers

Page:
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
saurav raghaw asked Dec 22, 2018
689 views
MIN HEAP
The time complexity of the most efficient algorithm to determine whether an arbitrary array of size ‘n’, is min-heap or not? (A) O(log n) (B) O(n) (C) O(n logn) (D) O(1)
The time complexity of the most efficient algorithm to determine whether an arbitrary array of size ‘n’, is min-heap or not?(A) O(log n)(B) O(n)(C) O(n logn)(D) O(1)
User Avatar
1 votes
1 votes
1 answer
2
gmrishikumar asked Dec 1, 2018
2,298 views
Kth Largest element in Min-Heap
What is the time complexity to find the Kth largest element in a Min-Heap? Or equivalently, What is the time complexity to find Kth smallest element in Max-Heap?
What is the time complexity to find the Kth largest element in a Min-Heap? Or equivalently, What is the time complexity to find Kth smallest element in Max-Heap?
User Avatar
1 votes
1 votes
1 answer
4
Rishabh Malhotra asked Feb 24, 2018
592 views
Min Heap & Probability
A min-heap contains $2^{(h + 1)} -1$ elements. If we randomly traverse the tree such that there is an equal probability of going left or right at each node, what is the probability of reaching the largest element?
A min-heap contains $2^{(h + 1)} -1$ elements. If we randomly traverse the tree such that there is an equal probability of going left or right at each node, what is the p...
User Avatar
Link Copied!