Assertion: search tree | /r/HasAspect | logarithmic height
Facets:
value: with high probability
type: OTHER
Source sentences:
text: Because random binary search trees are known to have logarithmic height with high probability, the same is true for treaps.