Answer:
Explanation:
AVL trees are used frequently for quick searching as searching takes O(Log n) because tree is balanced. Where as insertion and deletions are comparatively more tedious and slower as at every insertion and deletion, it requires re-balancing. Hence, AVL trees are preferred for application, which are search intensive.
The attached diagramm further ilustrate this