In the worst case, a single insertion in an AVL tree may require up to 2 rotations to maintain balance.

Rotations (single or double) are performed to maintain balance in an AVL tree after an insertion.

The worst-case time complexity for searching in a Red-Black tree is O(log n) due to its balanced nature.

Sorting is not a direct operation performed on a tree; trees are often used to facilitate sorting.

In-order traversal of a binary search tree retrieves nodes in sorted order.