An AVL tree is a self$-$balancing binary search tree. What is the primary purpose of rotations in AVL trees?

To improve the efficiency of searching for a specific key.

To convert the AVL tree into a different type of tree, such as a heap.

Rotations are not used in AVL trees; they are specific to other tree structures.

To maintain a balanced tree structure after insertions or deletions, ensuring logarithmic time complexity for operations.