Assertion: search tree | /r/HasProperty | searched in o(log ntime
Facets:
Source sentences:
text: A “balanced” binary search tree can be searched in O(log n) time, where n is the number of nodes in the tree.