In a binomial heap the root value is greater than left child and less than right child.

Category: QuestionsIn a binomial heap the root value is greater than left child and less than right child.
Editor">Editor Staff asked 4 weeks ago

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 Answers
Editor">Editor Staff answered 4 weeks ago

Correct choice is (b) False
 
The explanation is: Binomial tree used in making binomial heap follows min heap property.