Assertion: tree's node | /r/HasProperty | the root
Facets:
Source sentences:
text: As a data structure, a tree is defined as a node (the root), which itself consists of a value (of some data type, possibly empty), together with a list of references to other nodes (list possibly empty, references possibly null); symbolically:
text: The root node has depth zero, leaf nodes have height zero, and a tree with only a single node (hence both a root and leaf) has depth and height zero.
text: The topmost node in a tree is called the root node.
text: If the node has no parent (i.e., the node was the root), create a new root above this node (increasing the height of the tree).
text: The only node which lacks a full left sibling is the root, which is permitted to be less than half full.
text: nodes such that x 1 {\displaystyle x_{1}} is the root and all nodes except x n {\displaystyle x_{n}}