CS 201 Data Structures โ AVL tree Tutorial
1) For binary search tree balancing is not necessary. But for AVL tree balancing is necessary.
2)
a) Height of the left sub tree of the node v and height of the right sub tree of the node v
differ at most 1. That differenceshould be exactly -1,0,1. Balance of the node v can
calculate from fellow equation,
balance = height of left sub tree of node v โ height of right sub tree of node v
Balance for node a = height of left sub tree โ height of right sub tree
= 2 โ 2
= 0
Balance for node b = height of left sub tree โ height of right sub tree
= 1 โ 0
= 1
Balance for node c = height of left sub tree โ height of right sub tree
= 0 โ 1
= -1
