Assertion: tree's height | /r/HasProperty | logarithmic
Facets:
Source sentences:
text: Because random binary search trees are known to have logarithmic height with high probability, the same is true for treaps.
text: Using this lemma we can now show that the height of the tree is logarithmic.