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.
Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

2. What is the use of Rotations in Red Black Trees?
Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

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?
Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

4. How would you delete a Red Leaf node?
Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

5. How to search for a node whose value is less than that of the root node?
Explanation

Explanation

Explanation

Explanation