edited by
2,104 views

2 Answers

Best answer
11 votes
11 votes

Very Important Image. Don't miss....

Balancing factor $ = $ the height of left subtree $-$ the height of right subtree

Balancing factors of all the nodes are marked in the figure. 

Since there is no node that has a balancing factor greater than $1,$ we can say that the tree is balanced.

edited by
5 votes
5 votes
Balance Factor $=$ height $($left Sub Tree$)−$ height $($right Sub Tree$)$

for height balance tree, balance factor of every node  should be from $ -1  \ to \ 1 \ \  i.e. (-1,0,1)$

So, given tree is height balanced tree.
edited by

Related questions

14 votes
14 votes
3 answers
1
go_editor asked Dec 19, 2016
3,142 views
Consider the tree given in the below figure, insert $13$ and show the new balance factors that would arise if the tree is not rebalanced. Finally, carry out the required ...
8 votes
8 votes
2 answers
2
go_editor asked Dec 19, 2016
1,619 views
Define the height of a binary tree or subtree and also define a height-balanced (AVL) tree.
2 votes
2 votes
1 answer
3
im.raj asked Jun 16, 2016
5,432 views
The worst case time complexity of AVL is tree is better in comparison to binary search tree forSearch and Insert OperationsSearch and Delete OperationsInsert and Delete O...