Question: how do avl trees work?
Answer: An AVL tree is a binary search tree which has the following properties: ->The sub-trees of every node differ in height by at most one. ->Every sub-tree is an AVL tree. AVL tree checks the height of the left and the right sub-trees and assures that the difference is not more than 1.