Hello everyone when we search related to the data structure we always get the list of main topics. In this list we always see one name 'TREES'. A tree is a nonlinear data structure, compared to arrays, linked lists, stacks and queues which are linear data structures. A tree can be empty with no nodes or a tree is a structure consisting of one node called the root and zero or one or more subtrees. So there are many types of trees are available for Eg. Binary search tree, AVL tree , RB tree , etc. In this blog we will see the details about AVL tree, RB tree and difference between both the trees. AVL tree AVL tree is Named after their inventor Adelson, Velski and Landis, AVL trees are height balancing binary search tree. AVL tree checks the height of the left and the right sub-trees and assures that the difference is not more than 1. This difference is called the Balance Factor. ...