self doubt

Question

what is correct definition m=of max heap?

every node  should be greater than its children

or

every node should not be smaller than its children

Answer 1

There are two important points about the binary tree.

1. Root node should greater than it's children.
for example, you can pick up any root node traversed recursively to it's left and right child. root will be greater.
2. We follow left to right insertions of the node.

Comments

https://gateoverflow.in/71511/go2017-algorithm-19 

CHECK THIS ONE ITS IS SAYING ALWAYS YES

---

 eyeamgj

They are correct in that question

---

QUESTION DOES NOT CONTAIN CASE OF DUPLICATE ELEMENTS  LIKE 2,2,2,2,2,2??