rbtq

If the node of the red black tree to be deleted is red node

• Rotation and color swapping needed

• Only rotation is involved

• Only color swapping is needed

• none of the options is true

While insertion in the red black tree if the parent's sibling is red

• Rotation and color swapping is needed

• Rotation is needed

• Only color swapping is needed

• None of the options is true

While deletion of DB if the sibling is black and both it's children are red then

• Color of nearest child of black sibling does not matter

• Color of farthest child of black sibling does not matter

• We have different rule for this case

• none of the options are true

During double black rotation the parent always rotates

• in the direction of DB node

• Away from DB node

• Depends on the case

• none of the options are correct

Which tree is used when fewer insertions and lots of searching is involved

• AVL Tree

• Reb Black Tree

• Any variant of BS Tree

• None of the options are correct