+1 vote
in Data Structures & Algorithms I by (88.2k points)
The number of trees in a binomial heap with n nodes is

(a) logn

(b) n

(c) nlogn

(d) n/2

My question is from Binomial and Fibonacci Heap in portion Heap of Data Structures & Algorithms I

This question was posed to me in quiz.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
The correct choice is (a) logn

The best I can explain: At each depth there is a binomial tree in a binomial heap.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.