DP on Trees Maximum Path Sum in DSA C# - Interactive Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to define the TreeNode class with integer value and left/right children.

DSA C#

public class TreeNode {
    public int val;
    public TreeNode left;
    public TreeNode right;
    public TreeNode(int [1]) {
        this.val = val;
        left = null;
        right = null;
    }
}

Drag options to blanks, or click blank then click option'

Avalue

Bval

Cnode

Ddata

Attempts:

3 left

💡 Hint

Common Mistakes

Using a different parameter name but not assigning it properly.

Forgetting to assign the parameter to the field.

The constructor parameter should be named 'val' to assign it to the class field 'val'.

2fill in blank

medium

Complete the code to calculate the maximum path sum starting from the current node and going down one side.

DSA C#

private int MaxGain(TreeNode node) {
    if (node == null) return 0;
    int leftGain = Math.Max(MaxGain(node.left), [1]);
    int rightGain = Math.Max(MaxGain(node.right), 0);
    return node.val + Math.Max(leftGain, rightGain);
}

Drag options to blanks, or click blank then click option'

A0

Bint.MinValue

C-1

Dnode.val

Attempts:

3 left

💡 Hint

Common Mistakes

Using node.val instead of 0, which can cause incorrect sums.

Using negative values that reduce the path sum.

We use 0 as the minimum gain to ignore negative paths.

3fill in blank

hard

Fix the error in updating the global maximum path sum inside the MaxGain function.

DSA C#

maxSum = Math.Max(maxSum, node.val + leftGain + [1]);

Drag options to blanks, or click blank then click option'

A0

Bnode.val

CrightGain

DMath.Max(leftGain, rightGain)

Attempts:

3 left

💡 Hint

Common Mistakes

Adding node.val twice.

Using only one side gain instead of both.

The maximum path sum through the current node includes both left and right gains.

4fill in blank

hard

Fill both blanks to complete the MaxPathSum function that initializes and calls MaxGain.

DSA C#

public int MaxPathSum(TreeNode root) {
    maxSum = [1];
    MaxGain([2]);
    return maxSum;
}

Drag options to blanks, or click blank then click option'

Aint.MinValue

Broot

C0

Dnull

Attempts:

3 left

💡 Hint

Common Mistakes

Initializing maxSum to 0 which may ignore negative sums.

Calling MaxGain with null instead of root.

Initialize maxSum to smallest integer and start recursion from root.

5fill in blank

hard

Fill all three blanks to complete the MaxGain function with global maxSum update and return statement.

DSA C#

private int MaxGain(TreeNode node) {
    if (node == null) return 0;
    int leftGain = Math.Max(MaxGain(node.left), [1]);
    int rightGain = Math.Max(MaxGain(node.right), [2]);
    maxSum = Math.Max(maxSum, node.val + leftGain + [3]);
    return node.val + Math.Max(leftGain, rightGain);
}

Drag options to blanks, or click blank then click option'

A0

Bnode.val

CrightGain

Dint.MinValue

Attempts:

3 left

💡 Hint

Common Mistakes

Using node.val instead of 0 for gain comparison.

Not adding both left and right gains to maxSum.

Use 0 to ignore negative gains, add left and right gains to maxSum, return node.val plus max gain.

Practice

1. What does the "maximum path sum" in a tree represent in the context of DP on Trees Maximum Path Sum?

easy

A. The sum of all node values in the tree

B. The largest sum of node values on any path between two nodes in the tree

C. The maximum value of a single node in the tree

D. The longest path length in terms of number of edges

Solution

1. Step 1: Understand the problem definition

   The maximum path sum means the highest total sum of node values collected along any path connecting two nodes in the tree, not necessarily passing through the root.

2. Step 2: Differentiate from other sums

   It is not the sum of all nodes or just the maximum single node value, but the sum along a path that can include multiple nodes.

3. Final Answer:

   The largest sum of node values on any path between two nodes in the tree -> Option B

4. Quick Check:

   Maximum path sum = largest node value sum on any path [OK]

Hint: Maximum path sum is about sums along paths, not single nodes [OK]

Common Mistakes:

• Confusing maximum path sum with sum of all nodes
• Thinking it is just the maximum node value
• Assuming path must start at root

2. Which of the following C# method signatures is correct for a recursive function that returns the maximum path sum starting from a given tree node?

easy

A. int MaxPathSum(TreeNode node)

B. void MaxPathSum(TreeNode node)

C. int MaxPathSum(int node)

D. TreeNode MaxPathSum(TreeNode node)

Solution

1. Step 1: Identify the return type needed

   The function should return an integer representing the maximum path sum starting from the given node.

2. Step 2: Check parameter type

   The parameter must be a TreeNode object to access node values and children.

3. Final Answer:

   int MaxPathSum(TreeNode node) -> Option A

4. Quick Check:

   Return type int and parameter TreeNode required [OK]

Hint: Return int for sums, input parameter must be TreeNode [OK]

Common Mistakes:

• Using void return type when int is needed
• Passing int instead of TreeNode as parameter
• Returning TreeNode instead of int

3. Consider the following C# code snippet for a binary tree node class and a method to find maximum path sum:

public class TreeNode {
    public int val;
    public TreeNode left, right;
    public TreeNode(int x) { val = x; }
}

int maxSum = int.MinValue;

int MaxPathSum(TreeNode node) {
    if (node == null) return 0;
    int left = Math.Max(0, MaxPathSum(node.left));
    int right = Math.Max(0, MaxPathSum(node.right));
    maxSum = Math.Max(maxSum, left + right + node.val);
    return Math.Max(left, right) + node.val;
}

// Tree structure:
//       1
//      / \
//     2   3

TreeNode root = new TreeNode(1);
root.left = new TreeNode(2);
root.right = new TreeNode(3);
MaxPathSum(root);
Console.WriteLine(maxSum);

What is the output printed?

medium

A. 1

B. 5

C. 3

D. 6

Solution

1. Step 1: Calculate max path sums for children

   For node 2 and 3, left and right children are null, so returns 0. Max path sum at node 2 and 3 is their own value (2 and 3).

2. Step 2: Calculate max path sum at root

   At root (1), left = max(0, 2) = 2, right = max(0, 3) = 3. maxSum updated to max(-∞, 2+3+1) = 6. Return max(2,3)+1=4.

3. Final Answer:

   6 -> Option D

4. Quick Check:

   Sum of path 2->1->3 = 6 [OK]

Hint: Add left + right + node.val for max path at each node [OK]

Common Mistakes:

• Ignoring max(0, child) and using negative sums
• Returning sum without updating maxSum
• Confusing return value with maxSum

4. The following C# code attempts to compute the maximum path sum in a binary tree but has a bug:

int maxSum = int.MinValue;

int MaxPathSum(TreeNode node) {
    if (node == null) return 0;
    int left = MaxPathSum(node.left);
    int right = MaxPathSum(node.right);
    maxSum = Math.Max(maxSum, left + right + node.val);
    return Math.Max(left, right) + node.val;
}

What is the bug in this code?

medium

A. It does not ignore negative sums from children

B. It returns the wrong value type

C. It does not update maxSum correctly

D. It does not handle null nodes

Solution

1. Step 1: Analyze child sums usage

   The code uses left and right sums directly without ignoring negative values, which can reduce the path sum.

2. Step 2: Identify fix for negative sums

   We must use Math.Max(0, left) and Math.Max(0, right) to ignore negative sums from children.

3. Final Answer:

   It does not ignore negative sums from children -> Option A

4. Quick Check:

   Negative child sums must be ignored [OK]

Hint: Use Math.Max(0, childSum) to ignore negatives [OK]

Common Mistakes:

• Not using Math.Max(0, child) causing wrong sums
• Assuming return type is wrong
• Missing null checks (which are present)

5. Given a binary tree where some nodes have negative values, which approach correctly computes the maximum path sum using DP on trees? A) At each node, compute max path sum including both children and update global max; return max path sum including one child plus node value. B) At each node, sum all child node values and return total sum. C) At each node, return the maximum child value only. D) At each node, ignore children and consider only node value.

hard

A. Return the maximum child value only

B. Sum all child node values and return total sum

C. Compute max path sum including both children and update global max; return max path sum including one child plus node value

D. Ignore children and consider only node value

Solution

1. Step 1: Understand the correct DP approach

   The correct approach is to consider the maximum path sum including both children and update a global max, returning the max path sum including one child plus node value.

2. Step 2: Identify the incorrect options

   The other options do not correctly handle the problem. They either sum all children, return only the maximum child value, or ignore children and consider only node value.

3. Final Answer:

   Compute max path sum including both children and update global max; return max path sum including one child plus node value -> Option C

4. Quick Check:

   Correct DP uses both children sums and global max update [OK]

Hint: Include both children sums and update global max [OK]

Common Mistakes:

• Ignoring children nodes in calculation
• Summing all children without max checks
• Returning only child values without node