Choose the correct properties of weak-heap.

(a) Every node has value greater than the value of child node

(b) Every right child of node has greater value than parent node

(c) Every left child of node has greater value than parent node

(d) Every left and right child of node has same value as parent node

The question is from Weak Heap in division Heap of Data Structures & Algorithms I

I had been asked this question during an interview for a job.