> For the complete documentation index, see [llms.txt](https://mayanktyagi3111.gitbook.io/interview-prep/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/house-robber-iii.md).

# 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:**

```
Input: [3,2,3,null,3,null,1]

     3
    / \
   2   3
    \   \ 
     3   1

Output: 7 
Explanation: Maximum amount of money the thief can rob = 3 + 3 + 1 = 7.
```

**Example 2:**

```
Input: [3,4,5,1,3,null,1]

     3
    / \
   4   5
  / \   \ 
 1   3   1

Output: 9
Explanation: Maximum amount of money the thief can rob = 4 + 5 = 9.
```

```java
class Solution {
    public int helper(TreeNode root, boolean take, HashMap<TreeNode, int[]> map) {
        if (root == null)
            return 0;
        if (map.containsKey(root)) {
            if (take)
                return Math.max(map.get(root)[0], map.get(root)[1]);
            return map.get(root)[0];
        }
        if (take) {
            int option1 = helper(root.left, true, map) + helper(root.right, true, map);
            int option2 = root.val + helper(root.left, false, map) + helper(root.right, false, map);
            int[] temp = new int[] { option1, option2 };
            map.put(root, temp);
            return Math.max(option2, option1);
        } else {
            return helper(root.left, true, map) + helper(root.right, true, map);
        }
    }

    public int rob(TreeNode root) {
        HashMap<TreeNode, int[]> map = new HashMap<>();
        return helper(root, true, map);
    }
}
```


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/house-robber-iii.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.