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  

confused what "{1,#,2,3}" means?

思路 :假设左边已经翻转好了，定义左节点，然后做剩下的工作，也就是左节点的形状已经改变了，但是不影响最后只颠倒最后三个点的形状；注意只有一个node的情况下，就是他本身，这个情况需要判断；

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode upsideDownBinaryTree(TreeNode root) {
        if(root == null) {
            return null;
        } else {
            if(root.left == null && root.right == null) {
                return root;
            }
            TreeNode leftnode = root.left;
            TreeNode rightnode = root.right;
            TreeNode newhead = upsideDownBinaryTree(root.left);
            leftnode.left = rightnode;
            leftnode.right = root;
            root.left = null;
            root.right = null;
            return newhead;
        }
    }
}