AVL Tree : A Height Balancing BST
A height-balanced binary search tree in which difference between the heights of left subtree and right subtree can be atmost 1. It is a binary search tree where each node associated with a balance factor. If balance factor paired with node is 1,0, and – 1, it is said to be balanced.
Balance factor = height of left subtree – height of right subtree
It is important for a binary search tree to be…
View On WordPress















