Content deleted Content added
Billjones94 (talk | contribs) →External links: ndash Tags: Mobile edit Mobile web edit |
Removing May merge template; no case made; no support |
||
(31 intermediate revisions by 25 users not shown) | |||
Line 14:
Every [[Finite set|finite]] tree structure has a member that has no [[superior (hierarchy)|superior]]. This member is called the "root" or [[root node]]. The root is the starting node. But the converse is not true: infinite tree structures may or may not have a root node.
The names of relationships between nodes model the [[kinship terminology]] of family relations. The gender-neutral names "parent" and "child" have largely displaced the older "father" and "son" terminology. The term "uncle" is still widely used for other nodes at the same level as the parent, although it is sometimes replaced with gender-neutral terms like "ommer".<ref>{{cite web |title=Ethereum Glossary |url=https://github.com/ethereum/wiki/wiki/Glossary |website=GitHub |access-date=17 April 2019 |archive-date=25 April 2019 |archive-url=https://web.archive.org/web/20190425135357/https://github.com/ethereum/wiki/wiki/Glossary |url-status=live }}</ref>
* A node's "parent" is a node one step higher in the hierarchy (i.e. closer to the root node) and lying on the same branch.
Line 37:
== Examples of tree structures ==
[[File:Tree Map.png|thumb|A tree map used to represent a [[directory structure]] as a [[nested set]] ]]
[[File:1934-Thermionic-Tube-Chart.jpg|thumb|
* Internet:
** [[usenet hierarchy]]
** [[Document Object Model]]'s logical structure,<ref>{{cite web |url=http://www.w3.org/TR/DOM-Level-2-Core/introduction.html |title=What is the Document Object Model? |access-date=2006-12-05 |work=W3C Architecture ___domain |archive-date=2012-02-12 |archive-url=https://web.archive.org/web/20120212033934/http://www.w3.org/TR/DOM-Level-2-Core/introduction.html |url-status=live }}</ref> [[Yahoo!]] subject index, [[Curlie]]▼
▲** [[Document Object Model]]'s logical structure,<ref>{{cite web |url=http://www.w3.org/TR/DOM-Level-2-Core/introduction.html |title=What is the Document Object Model? |access-date=2006-12-05 |work=W3C Architecture ___domain }}</ref> [[Yahoo!]] subject index, [[Curlie]]
* [[Operating system]]: [[directory structure]]
* Information management: [[Dewey Decimal Classification|Dewey Decimal System]], [[Polythematic Structured Subject Heading System|PSH]], this hierarchical bulleted list
* Management: hierarchical [[organization]]al structures
* Computer
** [[binary search tree]]
** [[red–black tree]]
** [[AVL tree]]
** [[R-tree]]
** [[doubly logarithmic tree]]
* Biology: [[evolutionary tree]]
* Business: [[pyramid selling scheme]]
Line 80:
! style="padding:0 0.5em;" | \<br/>craft
|}</div>
{{
=== Nested sets ===
[[Nested set collection| Nested sets]] that use enclosure
<div style="float:left;clear:right;text-align:center;margin:0.2em 0 0.2em 1em;padding:0.5em 1em 1em 1em;border:1px solid silver;border-radius: 1em;">
Line 206 ⟶ 207:
*[[Jacques Bertin]], ''Semiology of Graphics'', 1983, University of Wisconsin Press (2nd edition 1973, {{ISBN|978-0299090609}};
*{{cite book |author=[[Donald E. Knuth]] |title=[[The Art of Computer Programming]] |series=Volume 1: Fundamental Algorithms |year=1968 |publisher=Addison-Wesley |pages=309–310}}
*Brian Johnson and [[Ben Shneiderman]], "[
*[[Peter Eades]], Tao Lin, and Xuemin Lin, "Two Tree Drawing Conventions", ''International Journal of Computational Geometry and Applications'', 1993, volume 3, number 2, pp. 133–153.
*{{cite book |author1=Manuel Lima |author1-link=Manuel Lima |title=The Book of Trees: Visualizing Branches of Knowledge|date=2014 |publisher=Princeton Architectural Press |___location=New York |isbn=978-1-616-89218-0 |edition=1st}}
Line 217 ⟶ 218:
{{DEFAULTSORT:Tree Structure}}
[[Category:Trees (data structures)]]
[[Category:Conceptual models]]
[[de:Baum (Datenstruktur)]]
|