AVl tree data structure is good for sorted data or semi sorted data??
Answers
Answered by
2
AVI tree data structure is good for sorted data
Answered by
0
AVL tree data structure is good for sorted data because it’s a type of binary search tree and binary search trees are meant for storing the already sorted data.
AVL tree is a special type of binary search tree in which the difference between the height of left and right subtree can’t be greater than one. It is a self-balancing Binary search tree.
A tree is a non-linear data structure and a binary search tree is a special type of tree in which each child can’t have more than two children and the left child must always be less than the root node and right child must be greater than the root node.
Similar questions