Assertion: tree's key | /r/HasProperty | √ n
Facets:
Source sentences:
text: After a long intermixed sequence of random insertion and deletion, the expected height of the tree approaches square root of the number of keys, √ n , which grows much faster than log n .