GATE | GATE MOCK 2017 | Question 45

Last Updated :
Discuss
Comments
Consider a binary min heap containing n elements and every node is having degree 2 ( i.e. full binary min heap tree). What is the probability of finding the largest element at the last level ?
1/2
1
1/n
1/2^n

This question is part of this quiz :

Top MCQs on HeapSort Algorithm with Answers,GATE 2017 Mock
Tags:
DSA Quiz
GATE
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy