Assertion: tree's node | /r/MadeOf | value
Facets:
value: after it
type: OTHER
value: with an optional value
type: OTHER
value: in the same node
type: LOCATION
value: in such a b-tree
type: OTHER
Source sentences:
text: A node is a structure which may contain a value or condition, or represent a separate data structure.
text: In the case of the tree above, if we could remember about the node containing the value 20, we would see that the node with value 5 is violating the BST property contract.
text: In such a B-tree, each node will contain only one value matching the value in a black node of the red–black tree, with an optional value before and/or after it in the same node, both matching an equivalent red node of the red–black tree.
text: A node is a structure which may contain a value or condition, or represent a separate data structure (which could be a tree of its own).
text: The greedy algorithm—simply traverse the tree, at every node check whether the node contains a value larger than the value at the left child and smaller than the value on the right child—does not work for all cases.
text: In the tree above, each node meets the condition that the node contains a value larger than its left child and smaller than its right child hold, and yet it is not a BST: the value 5 is on the right subtree of the node containing 20, a violation of the BST property.