Question

Difference between avl and binary search tree in tabular form

Answer 1

The only difference between AVL Tree and Binary Search Tree is that AVL Tree is a self-balancing tree BST. Balanced Tree means - for each node i in the tree, the difference between heights of its left and right child is 0 or 1, i.e - abs(height( left(i)) - height(right(i)))