每日任务:二叉树.114. 二叉树展开为链表

解题思路

很简单的递归

代码

/**
 * 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 {
    TreeNode tree;
    TreeNode temp;
    public void flatten(TreeNode root) {
        tree = new TreeNode();
        temp = tree;
        dfs(root);
        if (tree.right==null) return;
        root.left=null;
        root.right=tree.right.right;
    }
    public void dfs(TreeNode root){
        if (root==null) return;
        temp.right = new TreeNode(root.val);
        temp=temp.right;
        if (root.left!=null) dfs(root.left);
        if (root.right!=null) dfs(root.right);
    }
}