Content deleted Content added
Line 180:
I see several past comments about potential confusion surrounding min and max heaps but I think the problem is still there, specifically in the lead itself. There are three issues:
# The lead contradicts itself by defining ''heap property'' in terms of (first sentence) ''only''
# Even that restricted definition is further contradicted by the subsequent mentions of max and min heaps in terms of whether the correct relationships are (first sentence) "greater than" and "less than
# HOWEVER, that then makes the references to "''root node''" confusing. Putting everything up to that point together it would appear that one could have a heap with multiple nodes, all with the same key (whatever that means). But in that case, what is meant by "highest" or "lowest" (in terms, respectively, of the roots of a ''max heap'' and ''min heap'')? Part of the problem here is, as someone earlier noted, it's not exactly clear what a key is. The addition of "''or value''" helps, but not enough. ''Is it really the case'' that one could have a parent and child with the same key (value)? If so, in what way are they: a. different nodes, and; b. parent and child? If not (esp. to a.), then why is the heap property defined in terms of "...or equal to" properties?
| |||