http://wcipeg.com/wiki/index.php?title=Heap&feed=atom&action=historyHeap - Revision history2024-03-28T11:49:16ZRevision history for this page on the wikiMediaWiki 1.25.2http://wcipeg.com/wiki/index.php?title=Heap&diff=1484&oldid=prevBrian at 23:31, 11 December 20112011-12-11T23:31:19Z<p></p>
<table class='diff diff-contentalign-left'>
<col class='diff-marker' />
<col class='diff-content' />
<col class='diff-marker' />
<col class='diff-content' />
<tr style='vertical-align: top;'>
<td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 23:31, 11 December 2011</td>
</tr><tr><td colspan="2" class="diff-lineno" id="L6" >Line 6:</td>
<td colspan="2" class="diff-lineno">Line 6:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>[[Category:Heaps]]</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>[[Category:Heaps]]</div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">[[Category:Data structures]]</ins></div></td></tr>
</table>Brianhttp://wcipeg.com/wiki/index.php?title=Heap&diff=1481&oldid=prevBrian: Created page with "Various implementations of the priority queue abstract data type are known as '''heaps'''. A ''max-heap-ordered tree'' is a rooted tree in which every node's label i..."2011-12-11T23:30:01Z<p>Created page with "Various implementations of the <a href="/wiki/index.php?title=Priority_queue&action=edit&redlink=1" class="new" title="Priority queue (page does not exist)">priority queue</a> <a href="/wiki/Abstract_data_type" class="mw-redirect" title="Abstract data type">abstract data type</a> are known as '''heaps'''. A ''max-heap-ordered tree'' is a rooted <a href="/wiki/Tree" title="Tree">tree</a> in which every node's label i..."</p>
<p><b>New page</b></p><div>Various implementations of the [[priority queue]] [[abstract data type]] are known as '''heaps'''.<br />
<br />
A ''max-heap-ordered tree'' is a rooted [[tree]] in which every node's label is greater than or equal to the labels of all its children; so the maximum label may be found at the root. A ''max-heap'' is a collection of max-heap-ordered trees. The terms ''min-heap-ordered-tree'' and ''min-heap'' are defined analogously. A ''heap'' is either a max-heap or a min-heap.<br />
<br />
The word ''heap'', when unqualified, usually refers to the [[binary heap]] data structure. However, this is not the only data structure that is a heap; the [[binomial heap]] and [[Fibonacci heap]] are well-known varieties of heaps.<br />
<br />
[[Category:Heaps]]</div>Brian