AVL Tree - Insertion, Deletion & Rotation - Data Sructures & Algorithms 2016

After reading this you will know

1. What is AVL Tree

2. Why is AVL Tree needed

3. What is balancing property of AVL Tree

4. Minimum number of nodes in AVL Tree of height h

AVL trees, named after 3 researchers(Adelson, Velski and Landis) is the first Height balanced tree which avoids the degenerate nature of simple BST. Here we have discussed about the various terminologies used in context of AVL tres:

1. Left Left Imbalance

2. Right Right Imbalance

Left-Right Imbalance and

4. Left Right Imbalance

We have shown one working example on creation of an AVL tree.

Don't Forget to Subscribe Our Channel For more Software related videos.

https://www.youtube.com/channel/UCvtgPQq67sRfz3m2T_OrIWA

Our Facebook Page

https://www.facebook.com/Tuts-Online-1175068025891211/

Our Google+

https://plus.google.com/u/0/b/106482468968232599840/106482468968232599840/

Follows us on Our Twitter Account

https://twitter.com/mughal_zeeshi

Official Blog

https://tutsonline1.blogspot.com/