/*
思路是 在root层 把右子树整个挪到左子树的叶子节点处 再把左子树整个弄到右边 把左子树置空
所以需要返回一个根结点和叶子节点
需要注意的是 左边为空/右边为空/两个都不为空 三种情况下的操作是不一样的;
*/
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class resultType {
TreeNode root;
TreeNode leaf;
resultType(TreeNode root, TreeNode leaf) {
this.root = root;
this.leaf = leaf;
}
}
public class Solution {
public void flatten(TreeNode root) {
if(root == null) return;
resultType r = helper(root);
root = r.root;
return;
}
private resultType helper(TreeNode root) {
if(root == null) {
return new resultType(null, null);
}
if(root.left == null && root.right == null) {
return new resultType(root, root);
}
resultType left = helper(root.left);
resultType right = helper(root.right);
if(left.root == null) {//左子树为空
return new resultType(root, right.leaf);
}
if(right.root == null) {//右子树为空
root.right = left.root;
root.left = null;
return new resultType(root, left.leaf);
}
left.leaf.right = right.root;//两边都不为空
root.right = left.root;
root.left = null;
return new resultType(root, right.leaf);
}
}