Content deleted Content added
m Making a link more direct. |
No edit summary |
||
Line 1:
[[nl:boomstructuur]][[ja:木構造]][[nl:tree]]
A '''tree structure''' is a way of representing the [[hierarchy|hierarchical]] nature of a [[structure]] in a graphical form. It is named a 'tree structure', because the graph looks a bit like a [[tree]], even though the tree is generally shown upside down compared with a real tree, that is to say with the root at the top and the leaves at the bottom.
Line 7:
The converse is not true: infinite tree structures may have a root node.
<div style="width: 302px; float: right;">[[Image:binary-tree-structure.png]]<br>''Illustration: A tree structure showing the possible hierarchical organization of an encyclopedia. This specific example happens to a [[complete binary tree]], which means all nodes have exactly zero or two child nodes.''</div>
The lines connecting elements are called ''branches'', the elements themselves are called ''[[node|nodes]]''. Nodes without children are called ''end-nodes'' or ''leaves''.
| |||