leetcode 二叉树是否平衡 Balanced Binary Tree

MHSLZ1

于 2019-08-18 16:33:34 发布

阅读量99

点赞数

分类专栏： PHP 文章标签： leetcode php

本文链接：https://blog.csdn.net/u010785091/article/details/99706156

版权

PHP 专栏收录该内容

61 篇文章 0 订阅

订阅专栏

该博客探讨如何解决LeetCode中的二叉树平衡问题。定义一个高度平衡的二叉树是其每个节点的两个子树深度之差不超过1。通过示例解释了平衡和不平衡二叉树的情况。

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

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.

Example 1:

Given the following tree [3,9,20,null,null,15,7]:

Return true.

Example 2:

Given the following tree [1,2,2,3,3,null,null,4,4]:

Return false.

   function isBalanced($root) {
         if ($root === null) return true;
         return $this->depth($root)!==-1;
    }
    function depth($root) {
            
       if ($root === null) return 0;
           $leftDepth = $this->depth($root->left);
        $rightDepth = $this->depth($root->right);
        if( $leftDepth==-1||$rightDepth==-1||abs($leftDepth-$rightDepth)>1){
            return -1;
        }else{
            return max($leftDepth,$rightDepth)+1;
        }
    }