Summary
Keywords
Full Transcript
AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes. This difference is called the Balance Factor. In this tutorial we will solve 1 example based on AVL tree Deletion - 1) Deleting exisiting AVL tree nodes and balancing the tree if balance factor is imbalanced We will perform the rotations in both these cases whenever imbalance is detected. --------------------------------------------------------------------------------------------- Theory & Code article - https://simplesnippets.tech/what-is-avl-tree-data-structure-all-avl-operations-with-full-code/ Full Playlist - Full DSA playlist - https://www.youtube.com/watch?v=XCyuHSJS7XE&list=PLIY8eNdw5tW_zX3OCzX7NJ8bL1p6pWfgG Full C++ Programming for Beginners Course - https://www.youtube.com/watch?v=AKNGgAXTark&list=PLIY8eNdw5tW_o8gsLqNBu8gmScCAqKm2Q --------------------------------------------------------------------------------------------- Support Simple Snippets by Donations - Google Pay UPI ID - tanmaysakpal11@okicici PayPal - paypal.me/tanmaysakpal11 --------------------------------------------------------------------------------------------- Timecodes - 00:00 BST deletion use cases 06:24 Deletion in AVL example --------------------------------------------------------------------------------------------- Simple Snippets Official Website - http://simplesnippets.tech/ Simple Snippets on Facebook - https://www.facebook.com/simplesnippets/ Simple Snippets on Instagram - https://www.instagram.com/simplesnippets/ Simple Snippets on Twitter - https://twitter.com/simplesnippet Simple Snippets Google Plus Page - https://plus.google.com/+SimpleSnippets Simple Snippets email ID - [email protected] For More Technology News, Latest Updates and Blog articles visit our Official Website - http://simplesnippets.tech/ #avltree #binarysearchtree #datastructures #binarytree #dsa
