How does inserting $N$ objects one at a time into an ordered AVL tree yield an efficient sorting algorithim

35 Views Asked by At

If we assume reblalancing an AVL tree of height n after an insertion or deletion takes $O(n)$ operations.

How does inserting $N$ objects one at a time into an ordered AVL tree yield an efficient sorting algorithm?