[LeetCode] Balanced Binary Tree

/**
 * 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 ret;
    
    int DFS(TreeNode *root) {
        if (!root) return 0;
        
        int left = DFS(root->left);
        int right = DFS(root->right);
        
        if (abs(left - right) > 1)
            ret = false;
        
        return max(left, right) + 1;
    }
    
    bool isBalanced(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        ret = true;
        DFS(root);
        return ret;
    }
};

Small Case: 4ms

Large Case: 112ms

Time: O(n)

Space: O(1)