N/APosted on - 01/30/2015
Comparison between the following binary search trees:
Red Black Trees and Georgy Adelson-Velsky and Landis(AVL) Trees
1) Which tree is more self balancing?
2) Which tree has less time complexity in insertion of data?
3) Which tree has less time complexity in deletion of data?
4) Which tree has less time complexity to search data?
Data Structures: Red Black Trees VS AVL Trees
AVL tree is more self balancing because re-balancing is done to ensure that the heights of the two child sub-trees of a particular node always differ by a maximum of one.
Red Black Trees are less solidly balanced than AVL trees, which ultimately results in faster insertion and removal.This also results in slower retrieval of data in Red Black Trees. So Red Black Trees have less time complexity in insertion and deletion of data.
AVL trees have faster retrieval time leading to less time complexity in searching data.