AVL tree is well known and most popular self-balancing tree data structure that keeps tree balanced. Discuss why AVL tree is considered ideal for data (node) search but not considered as most suitable in case of insertion and deletion of data (node).
Answers
Answered by
1
AVL is considered the most Self-balancing binary search tree data structure. The heights of the AVL tree are determined by the child (sub trees of any node). The heights of the left and right sub trees can differ by at most one for all nodes. Re-balancing is required when the height of the nodes differ in order to restore their properties. Insertion and deletion need to be performed with some re-balancing. Hence it is not considered in case of insertion and deletion.
Similar questions