Min heap property
[…] for any given node C, if P is a parent node of C, then […] the key of P is less than or equal to the key of C.
\(P \le C \;\forall\; C \;|\; P\;\text{is parent of}\;C\)
Max heap property
[…] for any given node C, if P is a parent node of C, then the key (the value) of P is greater than or equal to the key of C
\(P \ge C \;\forall\; C \;|\; P\;\text{is parent of}\;C\)
Bibliography
“Heap (Data Structure).” 2022. Wikipedia, May. https://en.wikipedia.org/w/index.php?title=Heap_(data_structure)&oldid=1088468512.