I have already created binary tree, and i have to paint every node in red or black to make red-black tree. struct node { string name; int year; int
We know AVL trees are better for searching and red-black trees are better for insertion and deletion because they require lesser rotations, but what is the need