力扣刷题记录 -- JAVA--46---110. 平衡二叉树

@白圭

已于 2024-02-11 17:20:50 修改

阅读量40

点赞数

分类专栏： # 力扣习题记录册__JAVA__代码随想录文章标签： leetcode java 算法

于 2023-08-29 11:54:36 首次发布

本文链接：https://blog.csdn.net/taiyuezyh/article/details/132558527

版权

力扣习题记录册__JAVA__代码随想录专栏收录该内容

151 篇文章 0 订阅

订阅专栏

一、题目

在这里插入图片描述

二、代码

/**
 * 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 getDeepth(TreeNode pro)
    {
        if(pro == null) return 0;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(pro);
        int deetp_th = 0;
        while(!queue.isEmpty())
        {
           deetp_th++;
           int i;
           int length;
           length = queue.size();
           for(i=0;i<length;i++)
           {
               TreeNode cur = queue.poll();
               if(cur.left!=null ) queue.offer(cur.left);
               if(cur.right!=null) queue.offer(cur.right);
           }
        }
        return deetp_th;


    }
    public boolean isBalanced(TreeNode root) 
    {
       if(root == null) return true; 
    //    int get_deep=0;
    //    get_deep = getDeepth(root);
    //    System.out.println("get_deep  "+get_deep );
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        int deetp_left = 0;
        int deep_right = 0;
        while(!queue.isEmpty())
        {
           int i;
           int length;
           length = queue.size();
           for(i=0;i<length;i++)
           {
               TreeNode cur = queue.poll();
               if(cur.left!=null ) queue.offer(cur.left);
               if(cur.right!=null) queue.offer(cur.right);
               if(Math.abs(getDeepth(cur.left)-getDeepth(cur.right))>1) 
               {
                   System.out.println("跳出节点处的值  "+cur.val);
                   return false;
               }
           }
        }

       return true;
    }
}

三、运行结果

在这里插入图片描述

四、附录

/**
 * 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 getHeight(TreeNode pro) 
    {
        if( pro == null ) return 0;
        int left_height=0;
        int right_height = 0;
        if( pro.left != null ) 
        {
            left_height = getHeight(pro.left);
            if(left_height==-1) return-1;
        }
        if( pro.right != null)
        {
            right_height = getHeight(pro.right);
            if(right_height==-1) return-1;
        }

        if(Math.abs(left_height-right_height)>1) return -1;

        // System.out.println("  int  ");
        // System.out.println("  left_height   "  +left_height);
        // System.out.println("  right_height   " +right_height);

        return Math.max(left_height,right_height)+1;
    }
    public boolean isBalanced(TreeNode root) 
    {
        
        return getHeight(root) != -1;
    }
}