DATA STRUCTURES:

Recall that the balance factor of a node v is bf (v)- height(v.right)-height(v.left). When v has a right child but no left child, it is bf(v)-1 +height(v.right), and when vhas a left child but no right child, it is bf(v) --1 height(v.left)), and if v is a leaf it is 0. We might write this as height(v.right) - height(v.left) if v has both children if v has only a right child if v has only a left child if v is a leaf bf(v)-1+ height(v.right) 0.1 -(1 + height(v.left)) Annotate each node of the following binary search tree with its balance factor