Analysis of BuildTree

• Worst case: O(n2) as we’ve seen

• Average case assuming all orderings equally likely:

Previous slide

Next slide

Back to first slide

View graphic version