Hi, I'm just wondering and not finding the reason why if we have a tree with single node or actually if we have a leaf node of binary tree so it's by default satisfy the min/max heap property .. why?!

the min/max heap property is claiming that the root of the tree must be greater/smaller from its children respectively to max/min heap. there's no declaration if there's no children then what to decide.. as a result how we actually make a decision that if there's a root/node without children then we are saying its already satisfy min/max heap property?!

Maybe I'm not understanding the definition of min/max heap property and when its called min/max heap property.

thanks !

the min/max heap property is claiming that the root of the tree must be greater/smaller from its children respectively to max/min heap. there's no declaration if there's no children then what to decide.. as a result how we actually make a decision that if there's a root/node without children then we are saying its already satisfy min/max heap property?!

Maybe I'm not understanding the definition of min/max heap property and when its called min/max heap property.

thanks !

Last edited: