DELETION IN AVL TREE || DATA STRUCTURES
This covers the deletion method used to delete element in AVL Tree. Deletion method is same as deletion in Binary Search Tree just the difference is that in case of AVL Tree, after each deletion or insertion operation, you need to check whether tree is still balanced or not. If not then apply suitable rotation to make it balanced. Happy Learning !!