原题链接:https://leetcode-cn.com/problems/balanced-binary-tree/
题目
给定一个二叉树,判断它是否是高度平衡的二叉树。
本题中,一棵高度平衡二叉树定义为:
一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 1 。
示例 1:
输入:root = [3,9,20,null,null,15,7]
输出:true
思路
深搜遍历。
/**
* 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 is_balanced = true;
int depth(TreeNode* head) {
if (head == nullptr) {
return 0;
}
int left = depth(head->left);
int right = depth(head->right);
if (abs(left - right) > 1) {
is_balanced = false;
}
return max(left, right) + 1;
}
bool isBalanced(TreeNode* root) {
depth(root);
return is_balanced;
}
};
看了下题解,改进一下,能减少些计算提前退出。(当时写的时候就在想这个退出条件怎么写好些)
/**
* 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 depth(TreeNode* head) {
if (head == nullptr) {
return 0;
}
int left = depth(head->left);
if (left == -1) return -1;
int right = depth(head->right);
if (right == -1) return -1;
if (abs(left - right) > 1) return -1;
return max(left, right) + 1;
}
bool isBalanced(TreeNode* root) {
//改进一下退出条件
if (depth(root) == -1) {
return false;
}
return true;
}
};