Right Rotation: Exercise IV

Consider the schematic representation of the pattern that leads to a (single) right rotation:

The nodes with dashed lines are roots of their own subtree (they could be null too). After the application of a right rotation, we get the following:

Exercise Complete the implementation of rightRotation method:

Node<T> rightRotation (Node<T> root) {
  // TODO Implement me!
}

Note: The argument to rightRotation is the root of a subtree (not necessarily the root of the BST). The rightRotation must return the updated (new) root. Assume each node has access to its left/right subtrees.

Node<T> rightRotation(Node<T> root) {
  Node<T> child = root.left;
  root.left = child.right;
  child.right = root;
  root = child;
  return root;
}

Exercise What is the time complexity of your implementation of rightRotation method?