https://gunkies.org/index.php?action=history&feed=atom&title=Tree 2026-11-07T22:48:42Z Revision history for this page on the wiki MediaWiki 1.43.11 https://gunkies.org/w/index.php?title=Tree&diff=32905&oldid=prev 2024-01-14T00:57:02Z

<p>Define &#039;acyclic&#039;</p> <table style="background-color: #fff; color: #202122;" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #202122; 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" data-marker="−"></td><td style="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;"><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" data-marker="+"></td><td style="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;"><div>A '''tree''' is a way of structuring a collection of data <ins style="font-weight: bold; text-decoration: none;">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 style="font-weight: bold; text-decoration: none;">('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: #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;"><br></td><td class="diff-marker"></td><td style="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;"><br></td></tr> <tr><td class="diff-marker"></td><td style="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;"><div>[[Category: Basics]]</div></td><td class="diff-marker"></td><td style="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;"><div>[[Category: Basics]]</div></td></tr> <!-- diff cache key mediawiki-wiki_:diff:1.41:old-25740:rev-32905:php=table --> </table>

Jnc https://gunkies.org/w/index.php?title=Tree&diff=25740&oldid=prev 2022-05-01T10:53:47Z

<p>An OK start</p> <p><b>New page</b></p><div>A &#039;&#039;&#039;tree&#039;&#039;&#039; is a way of structuring a collection of data. It starts with a &#039;&#039;&#039;root&#039;&#039;&#039;&#039; 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 &#039;&#039;&#039;children&#039;&#039;&#039;, each of which similarly has one or more children. The whole collection forms what is technically named a &#039;directed acyclic [[graph]]&#039;. 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