Assertion: tree's key | /r/HasProperty | equal
Facets:
value: to any key
type: OTHER
Source sentences:
text: Thus we only need to keep the last visited node while traversing the tree and check whether its key is smaller (or smaller/equal, if duplicates are to be allowed in the tree) compared to the current key.
text: The tree additionally satisfies the binary search property: the key in each node is greater than or equal to any key stored in the left sub-tree, and less than or equal to any key stored in the right sub-tree.:287