二叉树转链表

按照二叉树的前序遍历转换成“链表”，即每个二叉树节点只有右节点

 

/**
 * 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) {
        if(root == null) return ;
        List<TreeNode> list = new LinkedList<>();
        preOrder(root,list);
        for(int i=0;i<list.size()-1;i++){
            list.get(i).left = null;
            list.get(i).right = list.get(i + 1);
        }
        list.get(list.size() - 1).left = null;
        list.get(list.size() - 1).right = null;
    
    }
    /**
    * 对二叉树进行前序遍历，将二叉树节点添加到一个链表中
    **/
    public void preOrder(TreeNode root,List list){
        if(root == null) return ;
        list.add(root);
        preOrder(root.left,list);
        preOrder(root.right,list);
    }
}