leetcode---House Robber III

The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the “root.” Besides the root, each house has one and only one parent house. After a tour, the smart thief realized that “all houses in this place forms a binary tree”. It will automatically contact the police if two directly-linked houses were broken into on the same night.

Determine the maximum amount of money the thief can rob tonight without alerting the police.

Example 1:
3
/ \
2 3
\ \
3 1
Maximum amount of money the thief can rob = 3 + 3 + 1 = 7.
Example 2:
3
/ \
4 5
/ \ \
1 3 1
Maximum amount of money the thief can rob = 4 + 5 = 9.

/**
 * 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:
    struct Money
    {
        int steal;     //该结点偷，收益为本结点偷与左右子结点不偷收益之和
        int notSteal;  //该结点不偷，收益为左右子结点偷收益之和

        Money()
        {
            steal = 0;
            notSteal = 0;
        }
    };

    Money dfs(TreeNode* root)
    {
        if(root == NULL)
            return Money();
        Money left = dfs(root->left);
        Money right = dfs(root->right);
        Money sum;
        sum.notSteal = left.steal + right.steal;   
        sum.steal = max(sum.notSteal, root->val + left.notSteal + right.notSteal);
        return sum;
    }

    int rob(TreeNode* root) 
    {
        Money m = dfs(root);
        return m.steal;
    }
};