2021-04-25 897. 递增顺序搜索树 [dfs]

最新推荐文章于 2022-08-03 22:10:56 发布

SuperFeHanHan

最新推荐文章于 2022-08-03 22:10:56 发布

阅读量98

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/weixin_44495738/article/details/116133330

版权

LeetCode 专栏收录该内容

57 篇文章 0 订阅

订阅专栏

897. 递增顺序搜索树

思路一：dfs + 重新构建一棵树

class Solution {
    TreeNode start = new TreeNode();
    public void dfs(TreeNode root){
        if(root==null)
            return;
        dfs(root.left);
        // System.out.println(root.val);
        start.right = new TreeNode(root.val);
        start = start.right;
        dfs(root.right);
    }
    public TreeNode increasingBST(TreeNode root) {
        TreeNode tmp = start;
        dfs(root);
        return tmp.right;
    }
}

思路二：dfs + 修改原有的树

class Solution {
    TreeNode start = new TreeNode();
    public void dfs(TreeNode root){
        if(root==null)
            return;
        dfs(root.left);
        // System.out.println(root.val);
        start.right = root;
        start = start.right;
        start.left = null; // 为了避免有cycle
        dfs(root.right);
    }
    public TreeNode increasingBST(TreeNode root) {
        TreeNode tmp = start;
        dfs(root);
        return tmp.right;
    }
}