110. Balanced Binary Tree (C语言)
高度平衡二叉树的判别
题目
Given a binary tree, determine if it is height-balanced.
Example 1:
Input: root = [3,9,20,null,null,15,7]
Output: true
Example 2:
Input: root = [1,2,2,3,3,null,null,4,4]
Output: false
Example 3:
Input: root = []
Output: true
Constraints:
The number of nodes in the tree is in the range [0, 5000].
-104 <= Node.val <= 104
解答
递归的方法
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
int Tra(struct TreeNode* root, int *num)
{
if(root == NULL){
*num = 0;
return true;
}
int left_num;
int right_num;
bool left_is = Tra(root->left, &left_num);
bool right_is = Tra(root->right, &right_num);
*num = (left_num > right_num) ? left_num+1 : right_num+1;
if(left_is && right_is)
{
if(left_num - right_num <=1 && left_num - right_num >= -1)
{
return true;
}
else return false;
}
else return false;
}
bool isBalanced(struct TreeNode* root){
int *num;
return Tra(root, &num);
}
总结
一个二叉树是高度平衡二叉树, 满足:
1、这个二叉树的两个子树都是高度平衡二叉树
2、左子树的高度和右子树的高度最大差1
在树的判别题中,递归式返回true与false比较好做,其他限制条件通过传值或指针解决。