// Time:  O(n)
// Space: O(h)

/**
 * 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 minCameraCover(TreeNode* root) {
        int result = 0;
        if (dfs(root, &result) == UNCOVERED) {
            ++result;
        }
        return result;
    }

private:
    int dfs(TreeNode* root, int *result) {
        int left = root->left ? dfs(root->left, result) : COVERED;
        int right = root->right ? dfs(root->right, result) : COVERED;
        if (left == UNCOVERED || right == UNCOVERED) {
            ++(*result);
            return CAMERA;
        }
        if (left == CAMERA || right == CAMERA) {
            return COVERED;
        }
        return UNCOVERED;
    }
    
    enum NODE {
        UNCOVERED, COVERED, CAMERA
    };
};