关闭

leetcode 110. Balanced Binary Tree

标签: leetcode
149人阅读 评论(0) 收藏 举报
分类:

题目

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.

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    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);                       
    }

    public  int maxDepth(TreeNode root){
        if(root==null) 
            return 0;


        return Math.max(maxDepth(root.left), maxDepth(root.right))+1;
    }
}
0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:63270次
    • 积分:1502
    • 等级:
    • 排名:千里之外
    • 原创:87篇
    • 转载:24篇
    • 译文:0篇
    • 评论:3条
    最新评论