zoukankan      html  css  js  c++  java
  • Java for LeetCode 110 Balanced Binary Tree

    Given a binary tree, determine if it is height-balanced.

    For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

    解题思路:

    递归即可,JAVA实现如下:

        public boolean isBalanced(TreeNode root) {
            if(root==null)
            	return true;
            if(Math.abs(maxDepth(root.left)-maxDepth(root.right))>1)
            	return false;
            return isBalanced(root.left)&&isBalanced(root.right);
        }
       static public int maxDepth(TreeNode root) {
            if(root==null)
                return 0;
            return Math.max(maxDepth(root.left), maxDepth(root.right))+1;
        }
    
  • 相关阅读:
    取随机数
    端口号
    cut命令
    渗透
    ssh免密登陆
    漏洞扫描
    信息收集1:DNSEUM命令
    Centos6与Centos7的区别
    HAPROXY+KEEPALIVED实现负载均衡
    this的用法
  • 原文地址:https://www.cnblogs.com/tonyluis/p/4524799.html
Copyright © 2011-2022 走看看