1,判断当前左右树的最大高度差是不是小于等于一
2，是的话继续判断，左右子树是否满足上面条件
#define max(a,b) (a>b?a:b)
int depth(struct TreeNode *root){
if(root == NULL)
return 0;
int l = depth(root->left);
int r = depth(root->right);
return max(l,r)+1;
}
bool isBalanced(struct TreeNode* root) {
if(root == NULL)
return true;
if(abs(depth(root->left)-depth(root->right)) > 1)
return false;
return isBalanced(root->left)&&isBalanced(root->right);
}
110. Balanced Binary Tree Description Given a binary tree...
题目：110. Balanced Binary Tree Given a binary tree, determi...
LeetCode 110 Balanced Binary Tree =================== 方法一...
104. Maximum Depth of Binary Tree 110. Balanced Binary Tr...
110. Balanced Binary Tree https://leetcode.com/problems/b...
110. Balanced Binary Tree 题目:https://leetcode.com/problem...
title: Balanced Binary Treetags:- balanced-binary-tree- N...
1,判断当前左右树的最大高度差是不是小于等于一2，是的话继续判断，左右子树是否满足上面条件
Given a binary tree, determine if it is height-balanced.F...
题目:Balanced Binary Tree Given a binary tree, determine if...
本文标题：110 balanced binary tree
本文链接：https://www.haomeiwen.com/subject/dllvvxtx.html
网友评论