使用原地交换的方式解答。
class Solution {
public void flatten(TreeNode root) {
TreeNode cur = root;
while (cur != null) {
TreeNode next = cur.left;
TreeNode pre = next;
if (next != null) {
TreeNode pre = next;
while (pre.right != null) {
pre = pre.right;
}
}
}
}
}