What is AVL tree in data structure?
Answers
Answered by
1
AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes. An Example Tree that is an AVL Tree.
Answered by
7
hope the above answr help u
Attachments:
Similar questions