题目L:
给定一个二叉树,原地将它展开为一个单链表。
示例:
例如,给定二叉树
1
/ \
2 5
/ \ \
3 4 6
将其展开为:
1
\
2
\
3
\
4
\
5
\
6
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/flatten-binary-tree-to-linked-list
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
解题思路:
使用前序遍历,将节点转换为list集合,再将list转换为树结构。
代码:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
List<TreeNode> list;
public void flatten(TreeNode root) {
list = new ArrayList<TreeNode>();
dfs(root);
TreeNode index = root;
for(int i=1;i<list.size();i++){
index.left = null;
index.right = list.get(i);
index = index.right;
}
}
public void dfs(TreeNode root){
if(root==null)
return ;
list.add(root);
if(root.left==null&&root.right==null)
return ;
dfs(root.left);
dfs(root.right);
}
}