Which of the Following Is the Algorithm for Rotation Right

Multiple Choice

Which of the following is the algorithm for Rotation Right (unbalanced search tree) ?

A) Remember the value of root.left (temp = root.left) .
Set root.left to the value of root.left.right.
Set temp.left to root.
Set root to right.
B) Remember the value of root.left (temp = root.right) .
Set root.right to the value of root.right.left.
Set temp.right to root.
Set root to temp.
C) Remember the value of root.left (temp = root.left) .
Set root.left to the value of root.left.right.
Set temp.left to root.
Set temp to root.
D) Remember the value of root.left (temp = root.left) .
Set root.left to the value of root.left.right.
Set temp.right to root.
Set root to temp.