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.
这个结果对于{1,2,3,4,5,6}的input是不是不对啊?
public class Solution {
public TreeNode UpsideDownBinaryTree(TreeNode root) {
TreeNode curr = root;
TreeNode prev = null;
TreeNode next = null;
TreeNode temp = null;