Find the maximum sum path that goes through the root of a tree and return its sum.

Question

Anonymous · Accepted Answer

I am going to create a tree for a customer churn model , here's how it would
look like from base to the top in a visual format

* All customers ( 0.05 risk of churn) - 5% risk of churn
   
   * If tenure lt 6 months - +10% risk of churn
     
     * Low engagement - +15% risk of churn
     
     * High engagement - +5% risk of churn
   
   * Tenure gt 6 months - +5% risk of churn

Now the next step is to write a function, for this i would use python function
definition

class Churn_Node:

def init(self, risk_score, left=None, right=None, condition=None):

self.risk_score = risk_score

self.left = left

self.right = right

self.condition = condition # e.g., "tenure < 6 months"

def max_churn_path_from_root(root):

if not root:

return 0

def max_down(node):

if not node:

return 0

left = max_down(node.left)

right = max_down(node.right)

# Choose branch contributing more risk

return node.risk_score + max(0, left, right)

return max_down(root)

Find the maximum sum path that goes through the root of a tree and return its sum.

Practice this question with AI

Go Premium

Community Answers

Unlock Full Access

Practice More Questions