Assertion: tree's node | /r/CapableOf | store key
Facets:
value: with two child nodes
type: OTHER
Source sentences:
text: In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree whose internal nodes each store a key greater than all the keys in the node's left subtree and less than those in its right subtree.
text: In a 2-3 B-tree, the internal nodes will store either one key (with two child nodes) or two keys (with three child nodes).
text: A binary search tree is a rooted binary tree, whose internal nodes each store a key (and optionally, an associated value), and each has two distinguished sub-trees, commonly denoted left and right.