A variation of a third entity with this name, invented by Aragon and Seidel in 1989, adds a priority attribute to the data, whileÂ Chazelle'sÂ "soft" versionÂ "corrupts" the data in order to achieve constant-time-bounded operations.
The Sorites paradox applies to an entity of this name, while the buddy-block allocator helps manage another entity with this name. A variation of a third entity with this name, invented by Aragon and Seidel in 1989, adds a priority attribute to the data, whileÂ Chazelle'sÂ "soft" versionÂ "corrupts" the data in order to achieve constant-time-bounded operations.Â The Fibonacci version usesÂ several trees at once, while the "leftist" version, much like NAQT, utilizes an s-value.Â The namesake of a big O of n log n sorting algorithm, for 10 points, give this term referring to either a large pool of dynamically allocatable memory also known as the free storeÂ or a modified tree in which each child is either greater or less than its parent, both named for their arbitrary size. 
The Sorites paradox applies to an entity of this name, while the buddy-block allocator helps manage another entity with this name.
heap [accept "heap of sand" or equivalents before "buddy-block"]