Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - C++ - 110. Balanced Binary Tree

---

題目：


解答：

/**
 * 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 isBalanced(TreeNode* root) {
        auto dfs = [&](this auto&& dfs, TreeNode *n) -> int {
            if (!n) {
                return 0;
            }

            int l = dfs(n->left);
            int r = dfs(n->right);
            if (l == -1 || r == -1 || abs(l - r) > 1) {
                return -1;
            }

            return max(l, r) + 1;
        };

        return dfs(root) != -1;
    }
};