前言
题目: 110. 平衡二叉树
文档: 代码随想录——平衡二叉树
编程语言: 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:
int maxDep(TreeNode* root) {
queue<TreeNode*> q;
int maxDepth = 0;
if (root != NULL) q.push(root);
while (!q.empty()) {
int size = q.size();
for (int i = 0; i < size; i++) {
TreeNode* node = q.front();
q.pop();
if (node -> left) q.push(node -> left);
if (node -> right) q.push(node -> right);
}
maxDepth++;
}
return maxDepth;
}
bool balance(TreeNode* left, TreeNode* right) {
int leftMax = maxDep(left);
int rightMax = maxDep(right);
if (leftMax - rightMax <= 1 && leftMax - rightMax >= -1) {
bool leftBalance = left == NULL ? true : balance(left -> left, left -> right);
bool rightBalance = right == NULL ? true : balance(right -> left, right -> right);
return leftBalance && rightBalance;
} else {
return false;
}
}
bool isBalanced(TreeNode* root) {
if (root == NULL) return true;
return balance(root -> left, root -> right);
}
};