what is avl tree in data structure and file system
Answers
Answered by
1
In computer science, an AVL tree (named after inventors Adelson-Velsky and Landis) is a self-balancing binary search tree. It was the first such data structure to be invented.
Answered by
0
Answer:
An avl tree is a binary search tree in which the hight of the left and right subtrees of the root differ by at most and in which the left and right subtrees are again avl tree
Similar questions