AVL Tree 4 rotation methods

AVL_Rotation_methods

/**
 * Performs a left rotation on a node
 * 
 * @param n The node to have the left rotation performed on
 * @return The new root of the subtree that is now balanced due to the rotation
 */
private Node<T> left(Node<T> n) {
	if(n != null){
		Node<T> temp = n.getRight();
		n.setRight(temp.getLeft());
		temp.setLeft(n);
		return temp;
	}
	return n;	
}

/**
 * Performs a right rotation on a node
 * 
 * @param n The node to have the right rotation performed on
 * @return The new root of the subtree that is now balanced due to the rotation
 */
private Node<T> right(Node<T> n) {
	if(n != null){
		Node<T> temp = n.getLeft();
		n.setLeft(temp.getRight());
		temp.setRight(n);
		return temp;
	}
	return n;
}

/**
 * Performs a left right rotation on a node
 * 
 * @param n The node to have the left right rotation performed on
 * @return The new root of the subtree that is now balanced due to the rotation
 */
private Node<T> leftRight(Node<T> n) {
	n.setLeft(left(n.getLeft()));
	Node<T> temp = right(n);
	return temp;
}

/**
 * Performs a right left rotation on a node
 * 
 * @param n The node to have the right left rotation performed on
 * @return The new root of the subtree that is now balanced due to the rotation
 */
private Node<T> rightLeft(Node<T> n) {
	n.setRight(right(n.getRight()));
	Node<T> temp = left(n);
	return temp;
}