AVL trees part-1 | Introduction to Balance Factor | DSA Course in Hindi
AVL Trees allows us to deal with the short comings of Binary Search Trees. BSTs provide efficient look up ( logarithmic complexity ) but only when the nodes are evenly divided on both sides of the node.
If the BST is heavy on either side ( Right skewed / Left skewed ) then it potentially assume a Linked List like structure and loose its charm as a BST.
In this video on AVL Tree introduction, we cover the following:
1. Disadvantages of BSTs ( as discussed above )
2. Understanding the Balance Factor ( the indicator of skewness of the BST or Binary Tree in general )
3. The AVL Tree property ( What's the characteristic property of AVL tree )
Also, this is a special video as it's the 100th video of our channel #fourofour, if you like the content we're producing and would like to encourage us further, you can hit the like / subscribe / comment / share button and we'll really appreciate that.
=================================================
We're always happy to socialise, please reach out ::
Youtube: @fourofourever
Linkedin: / rishabhio
Facebook: / fourofour.org
Pinterest: / fourofourever
Instagram: @rishabh.io
