Cohesity Interview: Binary Tree DP Problem (Maximum Non-Adjacent Subset Sum)

Problem overview from real interview of Cohesity:

Detailed Cohesity onsite interview experience focused on a tree dynamic programming problem: maximum sum of non-adjacent nodes. Emphasis on problem-solving approach.