explain what are avl trees and it's operations
Answers
Answered by
1
Answer:
AVL tree stands for Adelson, Velskii & Landis Tree, and it can be explained as an extension of the binary search tree data structure. ... The AVL tree structuring is implemented with the three basic data structure operations, namely search, insert and delete.
Similar questions