Data Structures using C Part 25 - AVL trees | self balanced binary search tree | AVL Tree in c

AVL Tree : AVL tree is a self balanced binary search tree. i.e., an AVL tree is also a binary search tree but it is a balanced tree. A binary tree is said to be balanced, if the difference between the heights of left and right subtrees of every node in the tree is either -1, 0 or +1. every node maintains a extra information known as balance factor. Balance factor = heightOfLeftSubtree - heightOfRightSubtree The AVL tree was introduced in the year of 1962 by G.M. Adelson-Velsky and Landis. Problem with BST : Representation of AVL tree : ankpro ankpro training Asp.net MVC C# C sharp Bangalore Rajajinagar Selenium Coded UI Mobile automation testing Mobile testing JQuery JavaScript .Net C C++ Components of the .Net framework Hello World Literal Keywords Variable Data types Operators Branching Loops Arrays Strings Structures Enums Functions