/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
<span style="white-space:pre"> </span>//获取根节点的先根遍历的最后一个节点
public TreeNode getPreOrderLast(TreeNode root){
if(root == null || (root.left == null && root.right == null)) return root;
TreeNode last = root;
while(true){
if(last.right != null) {
last = last.right;
}
else if(last.left != null){
last = last.left;
}
else{
break;
}
}
return last;
}
<span style="white-space:pre"> </span>//递归,将二叉树变成一个链表
public TreeNode solve(TreeNode root){
if(root == null || (root.left == null && root.right == null)) return root;
TreeNode rightNode = root.right;
TreeNode leftNode = root.left;
TreeNode last = getPreOrderLast(leftNode);
if(last != null) root.right = solve(leftNode);
if(last != null) {
last.right = solve(rightNode);
last.left = null;
}
if(last == null) root.right = solve(rightNode);//注意,last为空时,root.right 直接为right的链表化结果
root.left = null;
return root;
}
public void flatten(TreeNode root) {
if(root == null || (root.left == null && root.right == null))return ;
solve(root);
}
}