An AVL is another branch of trees, which is basically an extension to binary search tree(BST), which means to say that an AVL tree is basically a BST with some additional properties. The name AVL has given after the names of Adelson-Velskii and Landis, who gave this concept. AVL tree is a binary search with a balance condition. The balance condition must be easy to maintain, and it ensures that the depth of the tree is O (log n). The simplest idea is to require that the left and right subtrees have the same height.

An algorithm is a step by step method or a process followed or used to solve a particular problem. If the problem is viewed as a function, then an algorithm is an implementation for the function that transforms a required input for the function to the corresponding output which will be a solution of the problem. There can be different algorithms to solve the same particular problem as a given solution solves only one problem at a time.

## Jyotika Sharma

An AVL is another branch of trees, which is basically an extension to binary search tree(BST), which means to say that an AVL tree is basically a BST with some additional properties. The name AVL has given after the names of Adelson-Velskii and Landis, who gave this concept. AVL tree is a binary search with a balance condition. The balance condition must be easy to maintain, and it ensures that the depth of the tree is O (log n). The simplest idea is to require that the left and right subtrees have the same height.

## Jyotika Sharma

An algorithm is a step by step method or a process followed or used to solve a particular problem. If the problem is viewed as a function, then an algorithm is an implementation for the function that transforms a required input for the function to the corresponding output which will be a solution of the problem. There can be different algorithms to solve the same particular problem as a given solution solves only one problem at a time.