Performance

• Put: Worst case O(n), expected case if tree is random O(log n)

• Get: same as Put.

• getAll: O(n).

Previous slide

Next slide

Back to first slide

View graphic version