Consider a binary max 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 smallest element at the last level $?$

Question $1$ Answer

a$.$

$1$

b$.$

$1/2$

c$.$

$1/$n

d$.$

$1/2$n