Answer Happy

If a data structure supports an operation foo() such that a sequence of n calls to foo() takes O(n Ig n) time to perform in the worst case, then the amortized time of a foo() operation is el ) while the actual time of a single foo operation could be as high as of