LeetCode Algorithms #24 <Swap Nodes in Pairs>

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.

思路：

两个递归，一个递归不断查询root的子树是不是平衡二叉树，另一个递归是查看子树的高度，来辅助第一个递归的查询。

这个解有个可以优化的地方，查子树高度的行为，被重复执行了多次，可以放在一次遍历中完成。

解：

/**
 * 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 height(TreeNode * root)
    {
        if(root == nullptr)
            return 0;
        
        return max(height(root->left) + 1, height(root->right) + 1);
    }
    
    bool isBalanced(TreeNode* root) {
        if(root == nullptr)
            return true;
        
        if(root->left == nullptr)
        {
            if(root->right != nullptr && (root->right->left != nullptr || root->right->right != nullptr))
                return false;
            else
                return true;
        }
        
        if(root->right == nullptr)
        {
            if(root->left != nullptr && (root->left->left != nullptr || root->left->right != nullptr))
                return false;
            else
                return true;

        }
        
        return (isBalanced(root->left) && isBalanced(root->right) && (height(root->left) - height(root->right) <= 1 && height(root->left) - height(root->right) >= -1));
    }
};