LeetCode Balanced Binary Tree

coobj2008

于 2014-03-17 22:31:50 发布

阅读量219

点赞数

CC 4.0 BY-SA版权

分类专栏：面试题

本文链接：https://blog.youkuaiyun.com/coobj2008/article/details/21413191

面试题专栏收录该内容

144 篇文章

订阅专栏

本文探讨了如何判断给定的二叉树是否为高度平衡树，即每节点的左右子树深度之差不超过1。通过递归算法实现了这一判断过程，并详细解释了算法实现逻辑。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

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.

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isBalanced(TreeNode *root) {
    	if(root == NULL)
    		return true;
    	else if(isBalanced(root->left) && isBalanced(root->right) && maxDistance(root->left, root->right) <= 1)
    		return true;
    	else 
    		return false;
        
    }
private:
	int maxDepth(TreeNode *root) {
        if(root == NULL) 
            return 0;
        else
			return max(maxDepth(root->left),maxDepth(root->right))+1;
    } 
    int maxDistance(TreeNode *p, TreeNode *q) {
    	return maxDepth(p) > maxDepth(q) ? (maxDepth(p)-maxDepth(q)) : (maxDepth(q)-maxDepth(p));
    }
};