Assertion: tree | /r/HasProperty | small
Facets:
value: very
type: DEGREE
value: for a tree with n elements
type: OTHER
Source sentences:
text: Without help from fungus for better uptake of nutrients, trees would be small or would die.
text: To split a red-black tree into two smaller trees, those smaller than key x, and those larger than key x, first draw a path from the root by inserting x into the red-black tree.
text: The worst-case time complexity for searching a binary search tree is the height of the tree, which can be as small as O(log n) for a tree with n elements.
text: Unless the central leader is supported, the tree will be very small.
text: If the tree is small enough that you can pull it out by hand, you’ll only need to dig up its topsoil and roots.