代码随想录算法day14 | 二叉树 part02 | 226.翻转二叉树,101. 对称二叉树,104.二叉树的最大深度,111.二叉树的最小深度

226.翻转二叉树

/**
 * 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);
        swap(root);
        return root;
    }
    private void swap(TreeNode root){
        TreeNode tmp=root.left;
        root.left=root.right;
        root.right=tmp;
    }
}

101. 对称二叉树

public boolean compare(TreeNode left,TreeNode right){
        if(left.left==right.right&&left.right==right.left) return true;
        return false;
    }

没有办法让节点是相同的，if判断永远不能成立；

只能比较数值

疑问主要再怎么递归下去。

/**
 * 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);
    }
    public boolean compare(TreeNode left,TreeNode right){
        if(left==null&&right==null) return true;
        else if(left!=null&&right==null) return false;
        else if(left==null&&right!=null) return false;
        else if(left.val!=right.val) return false;
        boolean wai=compare(left.left,right.right);
        boolean nei = compare(left.right,right.left);
        return wai&&nei;
    }
}

104.二叉树的最大深度

/**
 * 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) {
        return getdepth(root);
    }
    public int getdepth(TreeNode root){
        if (root==null) return 0;
        int left_depth=getdepth(root.left);
        int right_depth=getdepth(root.right);
        return Math.max(left_depth,right_depth)+1;
    }
}

111.二叉树的最小深度

/**
 * 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) {
        int result_depth=0;
        // if (root.left==null) result_depth=getdepth(root.right);
        // else if(root.right==null) result_depth=getdepth(root.left);
        result_depth=getdepth(root);
        return result_depth;
    }
    public int getdepth(TreeNode root){
        if (root==null) return 0;
        int left_depth=getdepth(root.left);
        int right_depth=getdepth(root.right);
        if (root.left == null) {
            return right_depth + 1;
        }
        if (root.right == null) {
            return left_depth + 1;
        }
        return Math.min(left_depth,right_depth)+1;
    }
}