zoukankan      html  css  js  c++  java
  • LeetCode:110_Balanced Binary Tree | 平衡二叉树 | Easy

    要求:判断一棵树是否是平衡二叉树

    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.
     

    代码如下:

     1 struct TreeNode {
     2     int            val;
     3     TreeNode    *left;
     4     TreeNode    *right;
     5     TreeNode(int x): val(x),left(NULL), right(NULL) {}
     6 };
     7 
     8 int maxTreeDepth(TreeNode *root) //先求树的深度
     9 {
    10     if (NULL == root)
    11         return 0;
    12     int lval = maxTreeDepth(root->left);
    13     int rval = maxTreeDepth(root->right);
    14     return 1 + (lval > rval ? lval:rval);
    15 }
    16 bool isBalanced(TreeNode *root)//根据树的深度再来判断是否是平衡树
    17 {
    18     if(NULL == root)
    19         return true;
    20     int diff = maxTreeDepth(root->left) - maxTreeDepth(root->right);
    21     if (diff < -1 || diff > 1)
    22         return false;
    23     return isBalanced(root->left) && isBalanced(root->right);
    24 }
  • 相关阅读:
    Alpha阶段项目复审
    复审与事后分析
    测试与发布(Alpha版本)
    第七天
    第六天
    团队作业第4周——项目冲刺
    第一天
    第二天
    第四天
    第五天
  • 原文地址:https://www.cnblogs.com/bakari/p/4126706.html
Copyright © 2011-2022 走看看