给定一个二叉树,原地将它展开为链表。
例如,给定二叉树
1
/ \
2 5
/ \ \
3 4 6
将其展开为:
1
\
2
\
3
\
4
\
5
\
6
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/flatten-binary-tree-to-linked-list
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
题解:
- 将左子树摘下,接在右结点上,原右结点接在左子树的last_right上
- 迭代向右处理next
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public void flatten(TreeNode root) {
/**
将左子树摘下,接在右结点上,原右结点接在左子树的last_right上
迭代向右处理next
*/
if(root==null){
return ;
}
TreeNode left = root.left;
TreeNode right = root.right;
if(left!=null){
root.right = left;
root.left = null;
TreeNode next = findRight(left);
next.right = right;
}
flatten(root.right);//并非一定是开始的right,是root的下一个右
}
TreeNode findRight(TreeNode root){//find当前结点的最右结点
while(root.right!=null){
root = root.right;
}
return root;
}
}