AVL tree is efficient for the followingAInsertionBAll the optionsCSearchingDDeletion

An AVL tree, named after inventors Adelson-Velsky and Landis, is a self-balancing binary search tree. It is efficient for the following operations:

A) Insertion: In an AVL tree, after performing the standard binary search tree insertion, the tree checks for balance. If the tree is unbalanced, it performs rotations to balance the tree. This ensures that the tree remains balanced after each insertion, making the operation efficient.

B) All the options: Yes, an AVL tree is efficient for all the operations mentioned. It ensures that the tree remains balanced after each operation, which makes all operations efficient.

C) Searching: Searching in an AVL tree is efficient because it is a binary search tree. The time complexity for searching is O(log n), where n is the number of nodes in the tree. This is because the height of the tree is always log n.

D) Deletion: Similar to insertion, after performing the standard binary search tree deletion, the tree checks for balance. If the tree is unbalanced, it performs rotations to balance the tree. This ensures that the tree remains balanced after each deletion, making the operation efficient.