Assertion: search tree | /r/HasAspect | o(|nodes|height
Facets:
value: in the worst case
type: TEMPORAL
Source sentences:
text: However, in the worst case, binary search trees can have O(|Nodes|) height, when the unbalanced tree resembles a linked list (degenerate tree).