算法打卡，用于自律

最新推荐文章于 2024-11-04 21:39:11 发布

明天一定.

最新推荐文章于 2024-11-04 21:39:11 发布

阅读量342

点赞数

分类专栏：算法文章标签：算法

本文链接：https://blog.csdn.net/wai_58934/article/details/123682944

版权

算法专栏收录该内容

43 篇文章 11 订阅

订阅专栏

这篇博客涵盖了四个关于二叉树操作的解题方法：计算二叉树的最大深度、找到二叉树中两个节点的最近公共祖先、将二叉搜索树转换为递增BST以及在一个二叉搜索树中查找目标和的节点。这些解法展示了对二叉树结构的深入理解和高效遍历技巧。

摘要由CSDN通过智能技术生成

题目一

解法

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    List<List<Integer>> list = new ArrayList<List<Integer>>();
    public int maxDepth(TreeNode root) {
        method(0,root);
        return list.size();
    }
    public void method(int depth,TreeNode root){
        if(root==null) return;
        if(list.size()==depth){
            list.add(new ArrayList<Integer>());
        }
        method(depth+1,root.left);
        method(depth+1,root.right);
    }
}

题目二

解法

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        TreeNode ans = root;
        while(true){
            if(p.val<ans.val&&q.val<ans.val){
                ans = ans.left;
            }else if(p.val>ans.val&&q.val>ans.val){
                ans = ans.right;
            }else{
                break;
            }
        }
        return ans;
    }
}

题目三

解法

/**
 * 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<Integer> list = new ArrayList<Integer>();
    public TreeNode increasingBST(TreeNode root) {
        method(root);
        TreeNode tmp = new TreeNode(-1);
        TreeNode ans = tmp;
        for(int i:list){
            tmp.right = new TreeNode(i);
            tmp = tmp.right;
        }
        return ans.right;
    }
    public void method(TreeNode root){
        if(root==null) return;
        method(root.left);
        list.add(root.val);
        method(root.right);
    }
}

题目四

解法

/**
 * 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 {
    Set<Integer> set = new HashSet<Integer>();
    public boolean findTarget(TreeNode root, int k) {
        if (root == null) return false;
        if (set.contains(k - root.val)) return true;
        set.add(root.val);
        return findTarget(root.left, k) || findTarget(root.right, k);
    }
}

题目五

解法

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
        return method(nums,0,nums.length-1);
    }
    public TreeNode method(int[] nums,int low,int high){
        if(low>high) return null;
        int mid = low+(high-low)/2;
        TreeNode root = new TreeNode(nums[mid]);
        root.left = method(nums,low,mid-1);
        root.right = method(nums,mid+1,high);
        return root;
    }
}