LeetCode 110. Balanced Binary Tree（判断平衡二叉树）

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.

Example 1:

Given the following tree [3,9,20,null,null,15,7]:

Return true.

Example 2:

Given the following tree [1,2,2,3,3,null,null,4,4]:

Return false.

/**

 * Definition for a binary tree node.

 * struct TreeNode {

 *     int val;

 *     TreeNode *left;

 *     TreeNode *right;

 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}

 * };

 */

class Solution {

public:

    int depth(TreeNode *root)

    {

        if (root == NULL) return ;

        return max(depth(root->left), depth(root->right)) + ;

    }

    bool isBalanced(TreeNode *root)

    {

        if (root == NULL) return true;

        int left = depth(root->left);

        int right = depth(root->right);

        return abs(left - right) <=  && isBalanced(root->left) && isBalanced(root->right);

    }

};

巴特西

LeetCode 110. Balanced Binary Tree（判断平衡二叉树）

最新文章

热门文章