<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.conservapedia.com/index.php?action=history&amp;feed=atom&amp;title=Binary_tree</id>
	<title>Binary tree - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://www.conservapedia.com/index.php?action=history&amp;feed=atom&amp;title=Binary_tree"/>
	<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Binary_tree&amp;action=history"/>
	<updated>2026-11-19T18:08:04Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.35.14</generator>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=1740031&amp;oldid=prev</id>
		<title>Eac at 08:08, March 27, 2021</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=1740031&amp;oldid=prev"/>
		<updated>2021-03-27T08:08:51Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left diff-editfont-monospace&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 08:08, March 27, 2021&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l1&quot; &gt;Line 1:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;The '''binary tree''' is the simplest, and most commonly used, form of [[tree (data structure)|tree]].  A binary tree differs from other trees (such as a B3 tree) in that each node only has two links to other nodes.  By convention, these links are called the '''left''' and '''right''' links.  Data sorted before a node is inserted into the tree via the left link of that node, while data that sorts after is inserted into the tree via the right link.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;The '''binary tree''' is the simplest, and most commonly used, form of [[tree (data structure)|tree]].  A binary tree differs from other trees (such as a B3 tree) in that each node only has two links to other nodes.  By convention, these links are called the '''left''' and '''right''' links.  Data sorted before a node is inserted into the tree via the left link of that node, while data that sorts after is inserted into the tree via the right link.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Note that sometimes an additional '''parent''' link is used to point back to the node's parent in the tree, however this link is implied by the parent's left or right link.  Parent links are used to reduce the otherwise necessary context that must be kept during tree traversal, but they are not considered when describing the tree.  Thus, a binary tree with &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;a &lt;/del&gt;parent &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;link &lt;/del&gt;is not considered a B3 tree.  The root node of a tree is the node with no parent.  It is the point from which all traversals begin.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; 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;Note that sometimes an additional '''parent''' link is used to point back to the node's parent in the tree, however this link is implied by the parent's left or right link.  Parent links are used to reduce the otherwise necessary context that must be kept during tree traversal, but they are not considered when describing the tree.  Thus, a binary tree with parent &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;links &lt;/ins&gt;is not considered a B3 tree.  The root node of a tree is the node with no parent.  It is the point from which all traversals begin.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Balanced Trees==&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Balanced Trees==&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Eac</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=1468152&amp;oldid=prev</id>
		<title>Eac at 21:12, November 16, 2018</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=1468152&amp;oldid=prev"/>
		<updated>2018-11-16T21:12:30Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left diff-editfont-monospace&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 21:12, November 16, 2018&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l1&quot; &gt;Line 1:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;Trees are one of the fundamental [[data structure]]s of [[computer science]], along with the [[array]], the [[index]], and the [[look-up table]]. &lt;/del&gt;The '''binary tree''' is the simplest, and most commonly used, form of tree&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;.  The primary distinguishing feature of a tree &lt;/del&gt;data structure &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;is that it is tree-shaped (if balanced&lt;/del&gt;)&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;.  All &lt;/del&gt;tree &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;structures contain nodes which contain data, and links from the node to other nodes.  The relative position of the nodes to each other based on the links means that the tree's data can be retrieved in an ordered fashion if the proper traversal method is used&lt;/del&gt;.  A binary tree differs from other trees (such as a B3 tree) in that each node only has two links to other nodes.  By convention, these links are called the '''left''' and '''right''' links.  Data sorted before a node is inserted into the tree via the left link of that node, while data that sorts after is inserted into the tree via the right link.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; 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;The '''binary tree''' is the simplest, and most commonly used, form of &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;[[&lt;/ins&gt;tree &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;(&lt;/ins&gt;data structure)&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;|&lt;/ins&gt;tree&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;]]&lt;/ins&gt;.  A binary tree differs from other trees (such as a B3 tree) in that each node only has two links to other nodes.  By convention, these links are called the '''left''' and '''right''' links.  Data sorted before a node is inserted into the tree via the left link of that node, while data that sorts after is inserted into the tree via the right link.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Note that sometimes an additional '''parent''' link is used to point back to the node's parent in the tree, however this link is implied by the parent's left or right link.  Parent links are used to reduce the otherwise necessary context that must be kept during tree traversal, but they are not considered when describing the tree.  Thus, a binary tree with a parent link is not considered a B3 tree.  The root node of a tree is the node with no parent.  It is the point from which all traversals begin&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;.  A node whose left and right links don't point to another node is called a leaf, or terminal, node.  The depth of a node is the number of levels between that node and the root node&lt;/del&gt;.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; 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;Note that sometimes an additional '''parent''' link is used to point back to the node's parent in the tree, however this link is implied by the parent's left or right link.  Parent links are used to reduce the otherwise necessary context that must be kept during tree traversal, but they are not considered when describing the tree.  Thus, a binary tree with a parent link is not considered a B3 tree.  The root node of a tree is the node with no parent.  It is the point from which all traversals begin.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Balanced Trees==&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Balanced Trees==&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Eac</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=1466122&amp;oldid=prev</id>
		<title>Eac at 05:37, November 9, 2018</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=1466122&amp;oldid=prev"/>
		<updated>2018-11-09T05:37:06Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left diff-editfont-monospace&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 05:37, November 9, 2018&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l1&quot; &gt;Line 1:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Trees are one of the fundamental [[data structure]]s of [[computer science]], along with the [[array]], the [[index]], and the [[look-up table]]. The '''binary tree''' is the simplest, and most commonly used, form of tree.  The primary distinguishing feature of a tree data structure is that it is tree-shaped (if balanced).  All tree structures contain nodes which contain data, and links from the node to other nodes.  The relative position of the nodes to each other based on the links means that the tree's data can be retrieved in an ordered fashion if the proper traversal method is used.  A binary tree differs from other trees (such as a B3 tree) in that each node only has two links to other nodes.  By convention, these links are called the '''left''' and '''right''' links.  Data sorted before a node is inserted into the tree via the left link of that node, while data that sorts after is inserted into the tree via the right link.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Trees are one of the fundamental [[data structure]]s of [[computer science]], along with the [[array]], the [[index]], and the [[look-up table]]. The '''binary tree''' is the simplest, and most commonly used, form of tree.  The primary distinguishing feature of a tree data structure is that it is tree-shaped (if balanced).  All tree structures contain nodes which contain data, and links from the node to other nodes.  The relative position of the nodes to each other based on the links means that the tree's data can be retrieved in an ordered fashion if the proper traversal method is used.  A binary tree differs from other trees (such as a B3 tree) in that each node only has two links to other nodes.  By convention, these links are called the '''left''' and '''right''' links.  Data sorted before a node is inserted into the tree via the left link of that node, while data that sorts after is inserted into the tree via the right link.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Note that sometimes an additional '''parent''' link is used to point back to the node's parent in the tree, however this link is implied by the parent's left or right link.  Parent links are used to reduce the otherwise necessary context that must be kept during tree traversal, but they are not considered when describing the tree.  Thus, a binary tree with a parent link is not considered a B3 tree.  The root node of a tree is the node with no parent.  It is the point from which all traversals begin.  A node whose left and right links don't point to another node is called a leaf, or terminal, node.  The depth of a node is the number of levels between that node and the root node.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Note that sometimes an additional '''parent''' link is used to point back to the node's parent in the tree, however this link is implied by the parent's left or right link.  Parent links are used to reduce the otherwise necessary context that must be kept during tree traversal, but they are not considered when describing the tree.  Thus, a binary tree with a parent link is not considered a B3 tree.  The root node of a tree is the node with no parent.  It is the point from which all traversals begin.  A node whose left and right links don't point to another node is called a leaf, or terminal, node.  The depth of a node is the number of levels between that node and the root node.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;When a tree structure is constructed, the structure can become skewed to the left or right resulting in an unbalanced tree.  Trees constructed from random data tend to be more balanced.  A perfectly balanced binary tree will have the most shallow structure, meaning the least possible number of levels from the root node to the deepest node.  Because of the nature of the binary tree, a perfectly balanced tree will require no more than O(log n) comparisons to find a given node.  However, an unbalanced tree could require as much as O(n) comparisons.  Because of the performance problems associated with unbalanced trees, some binary tree implementations will adjust the nodes as they are added or deleted in order to keep the tree balanced.  Such binary trees are called AVL trees.  The extra complexity of implementation and the performance cost of the work of adjusting the tree structure means that AVL trees are not always the best choice when a binary tree is needed.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; 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;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; 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 class=&quot;diffchange diffchange-inline&quot;&gt;==Balanced Trees==&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; 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;When a tree structure is constructed, the structure can become skewed to the left or right resulting in an unbalanced tree.  Trees constructed from random data tend to be more balanced.  A perfectly balanced binary tree will have the most shallow structure, meaning the least possible number of levels from the root node to the deepest node.  Because of the nature of the binary tree, a perfectly balanced tree will require no more than O(log n) comparisons to find a given node.  However, an unbalanced tree could require as much as O(n) comparisons.  Because of the performance problems associated with unbalanced trees, some binary tree implementations will adjust the nodes as they are added or deleted in order to keep the tree balanced.  Such binary trees are called AVL&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;, or self-balancing, &lt;/ins&gt;trees.  The extra complexity of implementation and the performance cost of the work of adjusting the tree structure means that AVL trees are not always the best choice when a binary tree is needed.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Applications==&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Applications==&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Eac</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=1466121&amp;oldid=prev</id>
		<title>Eac at 05:34, November 9, 2018</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=1466121&amp;oldid=prev"/>
		<updated>2018-11-09T05:34:32Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left diff-editfont-monospace&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 05:34, November 9, 2018&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l1&quot; &gt;Line 1:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;A '''binary tree''' is &lt;/del&gt;one of the fundamental [[data structure]]s of [[computer science]], along with the [[array]], the [[index]], and the [[look-up table]]. The primary distinguishing &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;features &lt;/del&gt;of a &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;binary &lt;/del&gt;tree data structure &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;are &lt;/del&gt;that it is tree-shaped, and that &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;it consists solely of [[binary]] &lt;/del&gt;data &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;(therefore &lt;/del&gt;the binary tree, &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;unlike &lt;/del&gt;the &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;list &lt;/del&gt;and the &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;hash&lt;/del&gt;, is &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;a &lt;/del&gt;''&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;homogeneous&lt;/del&gt;'' data structure).&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; 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 class=&quot;diffchange diffchange-inline&quot;&gt;Trees are &lt;/ins&gt;one of the fundamental [[data structure]]s of [[computer science]], along with the [[array]], the [[index]], and the [[look-up table]]. &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;The '''binary tree''' is the simplest, and most commonly used, form of tree.  &lt;/ins&gt;The primary distinguishing &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;feature &lt;/ins&gt;of a tree data structure &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;is &lt;/ins&gt;that it is tree-shaped &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;(if balanced).  All tree structures contain nodes which contain data&lt;/ins&gt;, and &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;links from the node to other nodes.  The relative position of the nodes to each other based on the links means &lt;/ins&gt;that &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;the tree's &lt;/ins&gt;data &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;can be retrieved in an ordered fashion if &lt;/ins&gt;the &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;proper traversal method is used.  A &lt;/ins&gt;binary tree &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;differs from other trees (such as a B3 tree) in that each node only has two links to other nodes.  By convention&lt;/ins&gt;, &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;these links are called &lt;/ins&gt;the &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;'''left''' &lt;/ins&gt;and &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;'''right''' links.  Data sorted before a node is inserted into the tree via &lt;/ins&gt;the &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;left link of that node&lt;/ins&gt;, &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;while data that sorts after &lt;/ins&gt;is &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;inserted into the tree via the right link.&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; 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 class=&quot;diffchange diffchange-inline&quot;&gt;Note that sometimes an additional '''parent&lt;/ins&gt;''' &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;link is used to point back to the node's parent in the tree, however this link is implied by the parent's left or right link.  Parent links are used to reduce the otherwise necessary context that must be kept during tree traversal, but they are not considered when describing the tree.  Thus, a binary tree with a parent link is not considered a B3 tree.  The root node of a tree is the node with no parent.  It is the point from which all traversals begin.  A node whose left and right links don&lt;/ins&gt;'&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;t point to another node is called a leaf, or terminal, node.  The depth of a node is the number of levels between that node and the root node.&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt; &lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; 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 class=&quot;diffchange diffchange-inline&quot;&gt;When a tree structure is constructed, the structure can become skewed to the left or right resulting in an unbalanced tree.  Trees constructed from random &lt;/ins&gt;data &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;tend to be more balanced.  A perfectly balanced binary tree will have the most shallow &lt;/ins&gt;structure&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;, meaning the least possible number of levels from the root node to the deepest node.  Because of the nature of the binary tree, a perfectly balanced tree will require no more than O(log n) comparisons to find a given node.  However, an unbalanced tree could require as much as O(n&lt;/ins&gt;) &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;comparisons.  Because of the performance problems associated with unbalanced trees, some binary tree implementations will adjust the nodes as they are added or deleted in order to keep the tree balanced.  Such binary trees are called AVL trees.  The extra complexity of implementation and the performance cost of the work of adjusting the tree structure means that AVL trees are not always the best choice when a binary tree is needed&lt;/ins&gt;.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Applications==&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Applications==&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Eac</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=1251501&amp;oldid=prev</id>
		<title>DavidB4: category</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=1251501&amp;oldid=prev"/>
		<updated>2016-07-12T13:09:24Z</updated>

		<summary type="html">&lt;p&gt;category&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left diff-editfont-monospace&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 13:09, July 12, 2016&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l4&quot; &gt;Line 4:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 4:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Binary trees are traditionally used in the implementation of [[Huffman encoding]]. They are also used in the [[sorting]] algorithms [[heapsort]] and [[mergesort]]. Certain complex algorithms, such as [[MapReduce]], also make heavy use of binary trees. Finally, the binary tree can be used to represent certain dynamic processes, such as the distribution pattern of a file in a [[peer-to-peer]] network or the [[genealogy|genealogical]] history of a person who is the product of a long line of two-parent families.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Binary trees are traditionally used in the implementation of [[Huffman encoding]]. They are also used in the [[sorting]] algorithms [[heapsort]] and [[mergesort]]. Certain complex algorithms, such as [[MapReduce]], also make heavy use of binary trees. Finally, the binary tree can be used to represent certain dynamic processes, such as the distribution pattern of a file in a [[peer-to-peer]] network or the [[genealogy|genealogical]] history of a person who is the product of a long line of two-parent families.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[[Category:Data &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;structures&lt;/del&gt;]]&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; 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;[[Category:Data &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;Structures&lt;/ins&gt;]]&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>DavidB4</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=478704&amp;oldid=prev</id>
		<title>CSGuy: Genealology?</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=478704&amp;oldid=prev"/>
		<updated>2008-06-20T18:42:31Z</updated>

		<summary type="html">&lt;p&gt;Genealology?&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left diff-editfont-monospace&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 18:42, June 20, 2008&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l1&quot; &gt;Line 1:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;A '''binary tree''' is one of the &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;[[fundamentalism|&lt;/del&gt;fundamental&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;]] &lt;/del&gt;[[data structure]]s of [[computer science]], along with the [[array]], the [[index]], and the [[look-up table]]. The primary distinguishing features of a binary tree data structure are that it is tree-shaped, and that it consists solely of [[binary]] data (therefore the binary tree, unlike the list and the hash, is a ''homogeneous'' data structure).&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; 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;A '''binary tree''' is one of the fundamental [[data structure]]s of [[computer science]], along with the [[array]], the [[index]], and the [[look-up table]]. The primary distinguishing features of a binary tree data structure are that it is tree-shaped, and that it consists solely of [[binary]] data (therefore the binary tree, unlike the list and the hash, is a ''homogeneous'' data structure).&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Applications==&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Applications==&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Binary trees are traditionally used in the implementation of [[Huffman encoding]]. They are also used in the [[sorting]] algorithms [[heapsort]] and [[mergesort]]. Certain complex algorithms, such as [[MapReduce]], also make heavy use of binary trees. Finally, the binary tree can be used to represent certain dynamic processes, such as the distribution pattern of a file in a [[peer-to-peer]] network or the [[&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;genealology&lt;/del&gt;|&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;genealological&lt;/del&gt;]] history of a person who is the product of a long line of two-parent families.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; 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;Binary trees are traditionally used in the implementation of [[Huffman encoding]]. They are also used in the [[sorting]] algorithms [[heapsort]] and [[mergesort]]. Certain complex algorithms, such as [[MapReduce]], also make heavy use of binary trees. Finally, the binary tree can be used to represent certain dynamic processes, such as the distribution pattern of a file in a [[peer-to-peer]] network or the [[&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;genealogy&lt;/ins&gt;|&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;genealogical&lt;/ins&gt;]] history of a person who is the product of a long line of two-parent families.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[[Category:Data structures]]&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[[Category:Data structures]]&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>CSGuy</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=478642&amp;oldid=prev</id>
		<title>Bugler: /* Applications */ Maybe not a good analogy</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=478642&amp;oldid=prev"/>
		<updated>2008-06-20T16:45:23Z</updated>

		<summary type="html">&lt;p&gt;&lt;span dir=&quot;auto&quot;&gt;&lt;span class=&quot;autocomment&quot;&gt;Applications: &lt;/span&gt; Maybe not a good analogy&lt;/span&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left diff-editfont-monospace&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 16:45, June 20, 2008&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l2&quot; &gt;Line 2:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 2:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Applications==&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Applications==&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Binary trees are traditionally used in the implementation of [[Huffman encoding]]. They are also used in the [[sorting]] algorithms [[heapsort]] and [[mergesort]]. Certain complex algorithms, such as [[MapReduce]], also make heavy use of binary trees. Finally, the binary tree can be used to represent certain dynamic processes, such as the distribution pattern of a file in a [[peer-to-peer]] network or the [[genealology|genealological]] history of a person who is the product of a long line of two-parent families &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;(for example, [[Mary]], but not [[Jesus]])&lt;/del&gt;.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; 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;Binary trees are traditionally used in the implementation of [[Huffman encoding]]. They are also used in the [[sorting]] algorithms [[heapsort]] and [[mergesort]]. Certain complex algorithms, such as [[MapReduce]], also make heavy use of binary trees. Finally, the binary tree can be used to represent certain dynamic processes, such as the distribution pattern of a file in a [[peer-to-peer]] network or the [[genealology|genealological]] history of a person who is the product of a long line of two-parent families.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[[Category:Data structures]]&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[[Category:Data structures]]&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Bugler</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=478640&amp;oldid=prev</id>
		<title>Bugler at 16:44, June 20, 2008</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=478640&amp;oldid=prev"/>
		<updated>2008-06-20T16:44:45Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left diff-editfont-monospace&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 16:44, June 20, 2008&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l1&quot; &gt;Line 1:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;A '''binary &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;treee&lt;/del&gt;''' is one of the [[fundamentalism|fundamental]] [[data structure]]s of [[computer science]], along with the [[array]], the [[index]], and the [[look-up table]]. The primary distinguishing features of a binary tree data structure are that it is tree-shaped, and that it consists solely of [[binary]] data (therefore the binary tree, unlike the list and the hash, is a ''homogeneous'' data structure).&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; 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;A '''binary &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;tree&lt;/ins&gt;''' is one of the [[fundamentalism|fundamental]] [[data structure]]s of [[computer science]], along with the [[array]], the [[index]], and the [[look-up table]]. The primary distinguishing features of a binary tree data structure are that it is tree-shaped, and that it consists solely of [[binary]] data (therefore the binary tree, unlike the list and the hash, is a ''homogeneous'' data structure).&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Applications==&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Applications==&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Binary trees are traditionally used in the implementation of [Huffman encoding]]. They are also used in the [[sorting]] algorithms [[heapsort]] and [[mergesort]]. Certain complex algorithms, such as [[MapReduce]], also make heavy use of binary trees. Finally, the binary tree can be used to represent certain dynamic processes, such as the distribution pattern of a file in a [[peer-to-peer]] network or the [[genealology|genealological]] history of a person who is the product of a long line of two-parent families (for example, [[Mary]], but not [[Jesus]]).&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;color: #202122; 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;Binary trees are traditionally used in the implementation of &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;[&lt;/ins&gt;[Huffman encoding]]. They are also used in the [[sorting]] algorithms [[heapsort]] and [[mergesort]]. Certain complex algorithms, such as [[MapReduce]], also make heavy use of binary trees. Finally, the binary tree can be used to represent certain dynamic processes, such as the distribution pattern of a file in a [[peer-to-peer]] network or the [[genealology|genealological]] history of a person who is the product of a long line of two-parent families (for example, [[Mary]], but not [[Jesus]]).&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[[Category:Data structures]]&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt; &lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[[Category:Data structures]]&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Bugler</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=478627&amp;oldid=prev</id>
		<title>DrCrypto: New page: A '''binary treee''' is one of the fundamental data structures of computer science, along with the array, the index, and the look-up table. The prima...</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=478627&amp;oldid=prev"/>
		<updated>2008-06-20T16:33:20Z</updated>

		<summary type="html">&lt;p&gt;New page: A &amp;#039;&amp;#039;&amp;#039;binary treee&amp;#039;&amp;#039;&amp;#039; is one of the &lt;a href=&quot;/Fundamentalism&quot; title=&quot;Fundamentalism&quot;&gt;fundamental&lt;/a&gt; &lt;a href=&quot;/Data_structure&quot; title=&quot;Data structure&quot;&gt;data structures&lt;/a&gt; of &lt;a href=&quot;/Computer_science&quot; title=&quot;Computer science&quot;&gt;computer science&lt;/a&gt;, along with the &lt;a href=&quot;/Array&quot; title=&quot;Array&quot;&gt;array&lt;/a&gt;, the &lt;a href=&quot;/Index&quot; class=&quot;mw-redirect&quot; title=&quot;Index&quot;&gt;index&lt;/a&gt;, and the &lt;a href=&quot;/index.php?title=Look-up_table&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Look-up table (page does not exist)&quot;&gt;look-up table&lt;/a&gt;. The prima...&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;A '''binary treee''' is one of the [[fundamentalism|fundamental]] [[data structure]]s of [[computer science]], along with the [[array]], the [[index]], and the [[look-up table]]. The primary distinguishing features of a binary tree data structure are that it is tree-shaped, and that it consists solely of [[binary]] data (therefore the binary tree, unlike the list and the hash, is a ''homogeneous'' data structure).&lt;br /&gt;
&lt;br /&gt;
==Applications==&lt;br /&gt;
Binary trees are traditionally used in the implementation of [Huffman encoding]]. They are also used in the [[sorting]] algorithms [[heapsort]] and [[mergesort]]. Certain complex algorithms, such as [[MapReduce]], also make heavy use of binary trees. Finally, the binary tree can be used to represent certain dynamic processes, such as the distribution pattern of a file in a [[peer-to-peer]] network or the [[genealology|genealological]] history of a person who is the product of a long line of two-parent families (for example, [[Mary]], but not [[Jesus]]).&lt;br /&gt;
&lt;br /&gt;
[[Category:Data structures]]&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
</feed>