+1 vote
in Data Structures & Algorithms I by (88.2k points)
In a binomial heap the root value is greater than left child and less than right child.

(a) True

(b) False

Asked question is from Binomial and Fibonacci Heap topic in section Heap of Data Structures & Algorithms I

I had been asked this question in a job interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct choice is (b) False

The explanation is: Binomial tree used in making binomial heap follows min heap property.

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.

Categories

...