Assertion: tree's node | /r/MadeOf | between 1 and 3 values
Facets:
value: accordingly
type: MANNER
Source sentences:
text: A red–black tree is similar in structure to a B-tree of order[note 1] 4, where each node can contain between 1 and 3 values and (accordingly) between 2 and 4 child pointers.