Red Black Tree
1. What is the worst case Time Complexity for Searching, Insertion, and Deletion in a Red Black tree? Let ānā be the number of nodes.
2. What is the use of Rotations in Red Black Trees?
3. Let Z be the node to be inserted in the RB Tree. The uncle node of Z is black. Node Z, its parent node, and its grandparent node form a line. How would you insert it?
4. How would you delete a Red Leaf node?
5. How to search for a node whose value is less than that of the root node?