Assertion: algorithm's operation | /r/CapableOf | take o(log ntime
Facets:
Source sentences:
text: Since the insert operation on a self-balancing binary search tree takes O(log n) time, the entire algorithm takes O(n log n) time.