What are the applications of avl tree?

Binary Search Tree and AVL Tree are dictionary data structures. They are used for many search operations and also those operations where data is constantly inserted and deleted. AVL trees provide a better efficiency than BST as they maintain their upper bound of O(n*log n) through rotations.

Eg: the map and set library in c++ isimplementedusing trees.