首页 > 代码库 > [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.
这里要注意的是每个节点都要判断是否平衡，所以需要深搜下去。
int depth(TreeNode *node) { if (!node) return 0; if (!node->left) { return 1 + depth(node->right); } else if (!node->right) { return 1 + depth(node->left); } return 1+max(depth(node->left), depth(node->right));}bool isBalanced(TreeNode *root) { if (!root) return true; int val = depth(root->left) - depth(root->right); if (abs(val) <= 1) { return isBalanced(root->left) && isBalanced(root->right); } return false;}
[LeetCode] Balanced Binary Tree
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。