Question: what are the differences between avl tree and binary search tree?
Answer: Binary Search Tree:— A Binary tree, at every node Root is greater than Left child and Root is smaller than its Right child. AVL Tree:— AVL Tree is defined as the balanced Binary Search Tree. Here Balance means at every node the difference in the height of Left Sub Tree and the Right Sub Tree is -1, 0 or 1.