Revision as of 18:37, 11 February 2021 edit Joint ventura (talk \| contribs) 36 edits →Is first image ("Example of a binary max-heap...") correct?: new section Tag: 2017 wikitext editor ← Previous edit		Revision as of 01:09, 7 May 2021 edit undo 66.189.60.1 (talk) →Is "almost complete" correct?: new section Next edit →
Line 213: I'm not a specialist, but is the first image (https://en.wikipedia.org/wiki/Heap_(data_structure)#/media/File:Max-Heap.svg) correct? In the "array representation" part (at image bottom) shouln't be slot with value "17" connecting with "2" and "7", instead of slot with value "3"? [[User:Joint ventura\|Joint ventura]] ([[User talk:Joint ventura\|talk]]) 18:37, 11 February 2021 (UTC) == Is "almost complete" correct? == As a beginner programmer, I was reading this article and was confused by the term "almost complete." There's no definition of the property on this page, and I can only find definitions of "almost complete" as it applies ''specifically'' to binary trees. However, it's clearly stated that a heap can be nonbinary. So does "almost complete" mean anything in this context? What exact property of heaps is it meant to describe? --[[Special:Contributions/66.189.60.1\|66.189.60.1]] ([[User talk:66.189.60.1\|talk]]) 01:09, 7 May 2021 (UTC)

Talk:Heap (data structure): Difference between revisions