Assertion: tree | /r/HasProperty | ordered
Facets:
value: partially
type: DEGREE
value: such that for each t ∈ t
type: OTHER
value: in set theory
type: OTHER
Source sentences:
text: Assuming the tree is ordered, we can take a key and attempt to locate it within the tree.
text: In set theory, a tree is a partially ordered set (T, <) such that for each t ∈ T, the set {s ∈ T :
text: A tree is a partially ordered set (poset) (T, <) such that for each t ∈ T, the set {s ∈ T : s < t} is well-ordered by the relation <.