Binary Tree Upside Down

Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node that shares the same parent node) or empty, flip it upside down and turn it into a tree where the original right nodes turned into left leaf nodes. Return the new root.

For example:
Given a binary tree  {1,2,3,4,5} ,

    1
   / \
  2   3
 / \
4   5

return the root of the binary tree  [4,5,2,#,#,3,1].

   4
  / \
 5   2
    / \
   3   1  

class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    public TreeNode(int val){
        this.val = val;
    }
}

class Solution {
    public TreeNode UpsideDownBinaryTree(TreeNode root) {
        if(root == null)
            return root;
        else if(root.left == null && root.right == null)
            return root;

        TreeNode left = root.left;
        TreeNode right = root.right;
        TreeNode returnValue = UpsideDownBinaryTree(left);
        left.left = right;
        left.right = root;
        return returnValue;
    }
}