Balace Factor Of AVL TREE

Question

• Is this an example of AVL Tree ?  

Here Number of Left Child of Root =4  Number of Right Child of Root =2 Hence Balacing Factor is 2 Hence Not AVL Tree. 

If so please show me an exaple of AVL Tree with 7 nodes and Height 3. (Height of a tree with single node is 0)

Comments

Here your defintion of AVL tree is wrong 

AVL tree is Balanced Binary search tree whose (Hieght of Left subtree - Height of Right Subtree) = -1,0 or 1 for each and every node in the AVL tree

So,It is perfectly an AVL Tree

Answer 1

The above is perfectly an AVL tree. And the balancing factor you shud find out.

Height of Left tree-Height of Right tree

Here on left hand side 4 is given and on right hand side the height is three. Therefore the BF is as under:

4-3=1

And Balancing Factor is not 1.Okay. :)

Comments

Sorry 1. The typo. The BF is not 2. By mistake it took place. 4-3=1. I hope it helps you.

The BF is 1 and not 2. Yeah!!.Sorry for the typo again .:(

---

Refer this link below. I hope it helps u. 

http://eniac.cs.qc.cuny.edu/andrew/csci700-11/lecture7.pdf

Answer 2

It may or may not be an AVL tree. Skelton of the tree satisfies the balancing factor, but unless data in the nodes follow the BST condition nothing can be said.