Construct an AVL Tree with following data: 10 15 9 12 13 79 45 36 22

AVL Tree

• AVL Trees are Self-Balanced Binary Search Trees.

• In AVL trees, the balancing factor of each node is either 0 or 1 or -1.

• Balance Factor of AVL Tree calculated as = Height of Left Sub-tree - Height of Right Sub-tree

---

Construction of AVL Trees -

• Insertion Operation is …