Assertion: node | /r/HasProperty | the root
Facets:
value: in a node tree
type: LOCATION
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 topmost node in a tree is called the root node.
text: In a node tree, the top node is called the root
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: 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: The topmost node in a tree is called the root node.
text: The node that dominates all other nodes in a tree, and is itself dominated by none, is called the root node.
text: The topmost node in the tree is called the root.