After deleting a node in an AVL tree, self-balancing (zig-zag rotation or the left-right balancing) maintains O(logn) time that is not guaranteed in other unbalanced trees (like BST).
The Balancing operation is said to be O(logn).
What is the worst case for balancing? (I guess it will require balancing at every node all the way up till the root)
Any specific type of tree providing the worst case?