<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://www.wcipeg.com/wiki/index.php?action=history&amp;feed=atom&amp;title=Heap</id>
		<title>Heap - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://www.wcipeg.com/wiki/index.php?action=history&amp;feed=atom&amp;title=Heap"/>
		<link rel="alternate" type="text/html" href="http://www.wcipeg.com/wiki/index.php?title=Heap&amp;action=history"/>
		<updated>2026-05-09T11:57:35Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.25.2</generator>

	<entry>
		<id>http://www.wcipeg.com/wiki/index.php?title=Heap&amp;diff=1484&amp;oldid=prev</id>
		<title>Brian at 23:31, 11 December 2011</title>
		<link rel="alternate" type="text/html" href="http://www.wcipeg.com/wiki/index.php?title=Heap&amp;diff=1484&amp;oldid=prev"/>
				<updated>2011-12-11T23:31:19Z</updated>
		
		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class='diff diff-contentalign-left'&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
				&lt;tr style='vertical-align: top;'&gt;
				&lt;td colspan='2' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='2' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 23:31, 11 December 2011&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;L6&quot; &gt;Line 6:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 6:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;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;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;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;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;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;&quot;&gt;&lt;div&gt;[[Category:Heaps]]&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;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;&quot;&gt;&lt;div&gt;[[Category:Heaps]]&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt;&amp;#160;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;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;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;[[Category:Data structures]]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Brian</name></author>	</entry>

	<entry>
		<id>http://www.wcipeg.com/wiki/index.php?title=Heap&amp;diff=1481&amp;oldid=prev</id>
		<title>Brian: Created page with &quot;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...&quot;</title>
		<link rel="alternate" type="text/html" href="http://www.wcipeg.com/wiki/index.php?title=Heap&amp;diff=1481&amp;oldid=prev"/>
				<updated>2011-12-11T23:30:01Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot;Various implementations of the &lt;a href=&quot;/wiki/index.php?title=Priority_queue&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Priority queue (page does not exist)&quot;&gt;priority queue&lt;/a&gt; &lt;a href=&quot;/wiki/Abstract_data_type&quot; class=&quot;mw-redirect&quot; title=&quot;Abstract data type&quot;&gt;abstract data type&lt;/a&gt; are known as &amp;#039;&amp;#039;&amp;#039;heaps&amp;#039;&amp;#039;&amp;#039;.  A &amp;#039;&amp;#039;max-heap-ordered tree&amp;#039;&amp;#039; is a rooted &lt;a href=&quot;/wiki/Tree&quot; title=&quot;Tree&quot;&gt;tree&lt;/a&gt; in which every node&amp;#039;s label i...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;Various implementations of the [[priority queue]] [[abstract data type]] are known as '''heaps'''.&lt;br /&gt;
&lt;br /&gt;
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.&lt;br /&gt;
&lt;br /&gt;
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.&lt;br /&gt;
&lt;br /&gt;
[[Category:Heaps]]&lt;/div&gt;</summary>
		<author><name>Brian</name></author>	</entry>

	</feed>