What is AVL tree?
Posted On: Mar 17, 2020
AVL tree is a binary search tree where the node difference of heights in either the right and left subtrees is less than or equal to one. Three developers by name Adelson, Velskii and Landi developed the technique for balancing the binary trees height. From the first letter of their names, (AVL) came to be. AVL tree has advantages such as low time complexity in inserting and deleting operations.
Related Questions
Subscribe Our NewsLetter
Never Miss an Articles from us.
Recent Articles
Featured Categories
- Common Interview Questions
- Python Flask Interview Questions
- NoSQL Interview Questions
- jQuery Interview Questions
- C Programming Interview Questions
- AngularJs Interview Questions
- Node JS Interview Questions
- JavaScript Interview Questions
- Core Java Interview Questions
- HTML Interview Questions
- Laravel Interview Questions
- Wordpress Interview Questions
- PHP Interview Questions
C Programming Interview Questions
What are static variables in C ?
C defines another class of variables called static variables. Static variables are of two types:Static variables tha..
C Programming Interview Questions
What is a scope resolution operator in C ?
The scope resolution operator (::) is useful in C programming when both global and local variables have the same name,..
C Programming Interview Questions
What is register variable in C language ?
C language allows the use of the prefix register in primitive variable declarations. Such variables are called register..