水题
深度搜索每一节点的左右深度，左右深度差大于1就返回false。
class Solution {
public:
bool isBalanced(TreeNode *root) {
bool flag = true;
if (!root) return true;
dfs(root, flag);
return flag;
}
private:
int dfs(TreeNode *root, bool &flag) {
if (!root) return 0;
int leftH = dfs(root->left, flag) + 1;
int rightH = dfs(root->right, flag) + 1;
if (abs(leftH - rightH) > 1) flag = false;
return max(leftH, rightH);
}
};
110. Balanced Binary Tree https://leetcode.com/problems/b...
110. Balanced Binary Tree 题目:https://leetcode.com/problem...
110. Balanced Binary Tree Description Given a binary tree...
题目：110. Balanced Binary Tree Given a binary tree, determi...
104. Maximum Depth of Binary Tree 110. Balanced Binary Tr...
原题链接 水题深度搜索每一节点的左右深度，左右深度差大于1就返回false。
Given a binary tree, determine if it is height-balanced. ...
题目：Given a binary tree, determine if it is height-balance...
文章作者：Tyan博客：noahsnail.com | CSDN | 简书 1. Description 2. S...
Given a binary tree, determine if it is height-balanced. ...
本文标题：[LeetCode] 110. Balanced Binary
本文链接：https://www.haomeiwen.com/subject/zrwqxqtx.html
网友评论