red-black-tree
Red Black Tree vs Avl Tree
An AVL tree is a self-balancing binary search tree where the difference between heights of left and right subtrees cannot be more than one. A Red Black Tree is a category of the self-balancing binary search tree.