AVL trees are applied into the given situations:
- There are few insertion & deletion operations
- Short search time is required
- Input data is sorted or nearly sorted
AVL tree structures can be utilized in situations that require fast searching. However, the large cost of rebalancing may restrict the usefulness.