zoukankan      html  css  js  c++  java
  • [Leetcode 9] 110 Balanced Binary Tree

    Problem:

    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 everynode never differ by more than 1.

    Analysis:

    This problem is different from the 4.1 problem in Cracking the Code Interview. Their definitions of "Balanced" are different. In the CCI  problem, the definition is “a tree is balanced such that no two leaf nodes differ in distance from the root by more than one“. But here the definition is "the depth of the two subtrees of everynode never differ by more than 1".

    For a example, the following binary tree is balanced under the second definition but not balanced under the first definition:

                      1

               2             2

           3     3       3      

        4   4  4  4 

    Due to the intrinsically recursion of a tree, we can solve the problem in a resursive way. First if the root is null, then it's balanced; else if its two subtree's height differ more than one, it's not balanced; else return if its left and right subtree is balanced

    Code:

    View Code

    Here is a more efficient version with early exit

    View Code
     1 /**
     2  * Definition for binary tree
     3  * public class TreeNode {
     4  *     int val;
     5  *     TreeNode left;
     6  *     TreeNode right;
     7  *     TreeNode(int x) { val = x; }
     8  * }
     9  */
    10 public class Solution {
    11     public boolean isBalanced(TreeNode root) {
    12         // Start typing your Java solution below
    13         // DO NOT write main() function
    14         return height(root) != -1;
    15     }
    16     
    17     
    18     private int height (TreeNode node) {
    19         if (node == null) return 0;
    20         
    21         int lh = height(node.left);
    22         if (lh == -1)
    23             return -1;
    24             
    25         int rh = height(node.right);
    26         if (rh == -1)
    27             return -1;
    28         
    29         int height_dif = diff (lh, rh);
    30         if (height_dif > 1)
    31             return -1;
    32         else
    33             return 1 + max(lh, rh);
    34     }
    35     
    36     
    37     private int diff(int a, int b) {
    38         return (a>b) ? (a-b) : (b-a);
    39     }
    40     
    41     private int max(int a, int b) {
    42         return (a>b) ? a : b;
    43     }
    44     
    45 }

    Attention:

    The check balanced function and the height function are some kind of redundant, try to find a way that combine them together thus leaving only one parse of the given binary tree.

  • 相关阅读:
    自己做的关于select工具根据属性进行选择
    ae中栅格数据转为矢量数据
    影像图配准代码实现
    ae中最短路径分析
    AE常见接口之间的关系+常见概念 .
    GIS重要概念与术语(转)
    点线面缓冲分析(转自esri中国社区)
    ae中矢量数据转换成栅格数据
    单例模式
    利用gp自己做的生成缓冲区的代码
  • 原文地址:https://www.cnblogs.com/freeneng/p/3011657.html
Copyright © 2011-2022 走看看