算法学习Day11——二叉树2

最新推荐文章于 2024-11-09 21:51:15 发布

endless_?

最新推荐文章于 2024-11-09 21:51:15 发布

阅读量289

点赞数 9

分类专栏：算法文章标签：算法学习 leetcode

本文链接：https://blog.csdn.net/m0_62475528/article/details/136965999

版权

算法专栏收录该内容

20 篇文章 0 订阅

订阅专栏

本文介绍了如何使用递归和迭代方法解决LeetCode中的四个二叉树相关问题：反转二叉树、判断对称二叉树、求最大深度和求最小深度。

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

反转二叉树

226. 翻转二叉树 - 力扣（LeetCode）

/**
 * 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 TreeNode invertTree(TreeNode root) {
        if(root == null) return null;
        invertTree(root.left);
        invertTree(root.right);
        swapChildren(root);
        return root;

    }
    private void swapChildren(TreeNode root){
        TreeNode tmp =root.left;
        root.left= root.right;
        root.right= tmp;
    }
}

对称二叉树

101. 对称二叉树 - 力扣（LeetCode）

递归法

先判断两个节点是否同时为空，然后进入单层比较，然后接着递归比较内侧和外侧的。

/**
 * 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 boolean isSymmetric(TreeNode root) {
        return compare(root.left, root.right);

    }
    private boolean compare(TreeNode left, TreeNode right){
         if(left ==null && right != null) return false;
         if(left !=null && right == null) return false;
         if(left ==null && right==null) return true;
         if(left.val != right.val) return false;
         boolean compareOutside =compare(left.left,right.right);
         boolean compareInside = compare(left.right,right.left);
         return compareOutside && compareInside;
    }
}

二叉树的最大深度

104. 二叉树的最大深度 - 力扣（LeetCode）

迭代法

/**
 * 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 int maxDepth(TreeNode root) {
        if(root == null) return 0;   
        int leftDepth=maxDepth(root.left);
        int rightDepth=maxDepth(root.right);

        return Math.max(leftDepth,rightDepth)+1;
    }
}

二叉树的最小深度

111. 二叉树的最小深度 - 力扣（LeetCode）

递归

/**
 * 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 int minDepth(TreeNode root) {
        if(root ==null) return 0;
        int leftDepth =minDepth(root.left);
        int rightDepth = minDepth(root.right);
        if(root.left==null) return rightDepth+1;
        if(root.right == null) return leftDepth+1;
        return Math.min(leftDepth,rightDepth)+1;
    }
}