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

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.