二叉树进行前序遍历,获得各节点被访问到的顺序。由于将二叉树展开为链表之后会破坏二叉树的结构,因此在前序遍历结束之后更新每个节点的左右子节点的信息,将二叉树展开为单链表。
/**
* 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 {
public void flatten(TreeNode root) {
List<TreeNode> list=new ArrayList<>();
if(root==null) return;
previsit(root,list);
int size=list.size();
for(int i=1;i<size;i++){
TreeNode pre=list.get(i-1);
TreeNode cur=list.get(i);
pre.left=null;
pre.right=cur;
}
}
public void previsit(TreeNode root,List<TreeNode>list){
if(root==null) return ;
list.add(root);
previsit(root.left,list);
previsit(root.right,list);
}
}