Quiz: Include/Exclude Pattern

House Robber III: Max sum of non-adjacent nodes in a tree. You define dp[v][0] = not robbing $v$, dp[v][1] = robbing $v$. If you rob $v$, what constraint applies to children?

1. A.Cannot rob any child (they're adjacent to $v$)
2. B.Can rob exactly one child
3. C.Must rob all children too
4. D.No constraint on children