GATE CSE 1996 | Question: 1.14

Question

In the balanced binary tree in the below figure, how many nodes will become unbalanced when a node is inserted as a child of the node “g”?

• A. $1$
• B. $3$
• C. $7$
• D. $8$

Answer 1

(B).

$a,b,c$ will become unbalanced with Balance factor as $+2,+2,+2$ respectively. Balance factor should be $-1,0,+1$.

Balance factor =  Height(LST) - Height(RST)

Or  Balance factor = | Height(LST) - Height(RST) |

Answer 2

a,b and c are unbalanced 

Comments

@ Rishi yadav what s the height of leaf node you have taken while calculating the B.F.?

---

May be this help you if any correction comment here thank u

Answer 3

Answer is b and the resultant tree you get after insersion is the following