Redirecting to
NADOS

House Robber In Binary Tree

  Prev   Next

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

1. You are given a partially written function to solve.
2. 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.
3. Input and Output is managed for you.
Input Format 
Input is managed for you.
Output Format 
Output is managed for you.
Question Video
Constraints 
0 <= Number of Nodes <= 10^9
-10^9 <= value of Node data <= 10^9
Sample Input 
15
1
1
-1
1
1
-1
1
-1
-1
1
-1
-1
1
-1
-1
Sample Output 
4


  • Asked in Companies
  • Related Topics






Video Solution

Code Solution

Run
 
Run
Id Name