首页 > 代码库 > Leetcode Balanced Binary Tree
Leetcode Balanced Binary Tree
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
class Solution {public: int depth(TreeNode *root){ if(!root) return 0; return 1+max(depth(root->left),depth(root->right)); } bool isBalanced(TreeNode *root) { if(!root) return true; return abs(depth(root->left)-depth(root->right))<=1 && isBalanced(root->left) && isBalanced(root->right); }};
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。