110. 平衡二叉树(C++题解版含VS可运行源程序)
1.题解
递归
- 计算左右子树深度,返回较大值,若左右子树高度差大于1,则此树不是平衡二叉树;
- 递归判断左右子树是否平衡。
2.力扣C++源码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
bool isBalanced(TreeNode* root) {
if (root == NULL)return true;
int bl = isBalanced(root -> left);
int br = isBalanced(root -> right);
if (!bl || !br)return false;
int l = depth(root->left);
int r = depth(root->right);
if (abs(l - r) > 1)return false;
return true;
}
int depth(TreeNode* root) {
if (root == NULL)return 0;
int l = depth(root