https://gunkies.org/w/index.php?title=Tree&feed=atom&action=historyTree - Revision history2024-03-29T06:20:43ZRevision history for this page on the wikiMediaWiki 1.30.0https://gunkies.org/w/index.php?title=Tree&diff=32905&oldid=prevJnc: Define 'acyclic'2024-01-14T00:57:02Z<p>Define 'acyclic'</p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr style="vertical-align: top;" lang="en">
<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 00:57, 14 January 2024</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1" >Line 1:</td>
<td colspan="2" class="diff-lineno">Line 1:</td></tr>
<tr><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: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>A '''tree''' is a way of structuring a collection of data. It starts with a '''root'''' element, which has to be found by some external (to the data collection) means. From there on, each element contains [[pointer]]s to one or more '''children''', each of which similarly has one or more children. The whole collection forms what is technically named a 'directed acyclic [[graph]]'. When drawn out schematically, with the single root element at the top, the first-generation children on the layer immediately below the root, and so on, it resembles a conifer tree, hence the name.</div></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>A '''tree''' is a way of structuring a collection of data <ins class="diffchange diffchange-inline">items</ins>. It starts with a '''root'''' element, which has to be found by some external (to the data collection) means. From there on, each element contains [[pointer]]s to one or more '''children''', each of which similarly has one or more children. The whole collection forms what is technically named a 'directed acyclic [[graph]]' <ins class="diffchange diffchange-inline">('acyclic' meaning without cycles/loops; i.e. from the root, there is only a ''single'' path to ''any'' leaf element)</ins>. When drawn out schematically, with the single root element at the top, the first-generation children on the layer immediately below the root, and so on, it resembles a conifer tree, hence the name.</div></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: Basics]]</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: Basics]]</div></td></tr>
</table>Jnchttps://gunkies.org/w/index.php?title=Tree&diff=25740&oldid=prevJnc: An OK start2022-05-01T10:53:47Z<p>An OK start</p>
<p><b>New page</b></p><div>A '''tree''' is a way of structuring a collection of data. It starts with a '''root'''' element, which has to be found by some external (to the data collection) means. From there on, each element contains [[pointer]]s to one or more '''children''', each of which similarly has one or more children. The whole collection forms what is technically named a 'directed acyclic [[graph]]'. When drawn out schematically, with the single root element at the top, the first-generation children on the layer immediately below the root, and so on, it resembles a conifer tree, hence the name.<br />
<br />
[[Category: Basics]]</div>Jnc