DP on Trees Maximum Path Sum in DSA C++ - Build from Scratch

DP on Trees Maximum Path Sum

📖 Scenario: Imagine you have a network of connected cities represented as a tree. Each city has a value representing its importance. You want to find the path through the network that yields the highest total importance. This path can start and end at any city but must follow the connections.

🎯 Goal: Build a program that finds the maximum path sum in a tree using dynamic programming on trees.

📋 What You'll Learn

Create a tree using adjacency lists with given nodes and values

Use a helper variable to track the maximum path sum found so far

Implement a depth-first search (DFS) with dynamic programming to compute maximum path sums

Print the maximum path sum after processing the tree

💡 Why This Matters

🌍 Real World

Finding the maximum path sum in a tree is useful in network analysis, such as finding the most valuable route in a communication or transportation network.

💼 Career

This problem teaches tree traversal and dynamic programming techniques, which are common in technical interviews and real-world software engineering tasks involving hierarchical data.

1

Create the tree structure and node values

Create an adjacency list called tree for 5 nodes (0 to 4) with edges: (0-1), (0-2), (1-3), (1-4). Also create a vector values with these exact values: 1, 2, 3, 4, 5 for nodes 0 to 4 respectively.

DSA C++

# Create adjacency list 'tree' and vector 'values' with given edges and values
# Your code here

Hint

Use a vector of vectors for the tree. Add edges in both directions since the tree is undirected. Use a vector for node values.

2

Add a variable to track the maximum path sum

Add a global integer variable called maxSum and initialize it to INT_MIN to track the maximum path sum found during traversal.

DSA C++

#include 

int maxSum = INT_MIN;  // Your code here

Hint

Include <climits> to use INT_MIN. Declare maxSum outside main() for global access.

3

Implement DFS with DP to find maximum path sum

Write a recursive function dfs that takes int node, int parent, const vector<vector<int>>> &tree, and const vector<int> &values. It returns the maximum path sum starting from node going down. Update maxSum with the maximum path sum found including paths through node. Use the logic: for each child, get the max path sum down, keep top two max sums, update maxSum with sum of node value plus top two child sums, and return node value plus max child sum (or 0 if negative).

DSA C++

int dfs(int node, int parent, const vector>& tree, const vector& values) {
    // Your code here
}

int main() {
    vector> tree(5);
    tree[0].push_back(1);
    tree[1].push_back(0);
    tree[0].push_back(2);
    tree[2].push_back(0);
    tree[1].push_back(3);
    tree[3].push_back(1);
    tree[1].push_back(4);
    tree[4].push_back(1);

    vector values = {1, 2, 3, 4, 5};

    return 0;
}

Hint

Use DFS to explore children. Track top two max child sums. Update global maxSum with node value plus these two sums. Return node value plus max child sum or 0 if negative.

4

Print the maximum path sum

Add a cout statement to print the value of maxSum after calling dfs in main().

DSA C++

#include 
#include 
#include 

using namespace std;

int maxSum = INT_MIN;

int dfs(int node, int parent, const vector>& tree, const vector& values) {
    int max1 = 0, max2 = 0;
    for (int child : tree[node]) {
        if (child == parent) continue;
        int val = dfs(child, node, tree, values);
        if (val > max1) {
            max2 = max1;
            max1 = val;
        } else if (val > max2) {
            max2 = val;
        }
    }
    int currentSum = values[node] + max1 + max2;
    if (currentSum > maxSum) maxSum = currentSum;
    return values[node] + max1 > 0 ? values[node] + max1 : 0;
}

int main() {
    vector> tree(5);
    tree[0].push_back(1);
    tree[1].push_back(0);
    tree[0].push_back(2);
    tree[2].push_back(0);
    tree[1].push_back(3);
    tree[3].push_back(1);
    tree[1].push_back(4);
    tree[4].push_back(1);

    vector values = {1, 2, 3, 4, 5};

    dfs(0, -1, tree, values);

    cout << maxSum << endl;  // Your code here
    return 0;
}

Hint

Print maxSum after DFS completes to see the maximum path sum.

Practice

1. What does the "Maximum Path Sum" in a tree represent in the context of dynamic programming on trees?

easy

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

B. The sum of all node values in the tree

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

D. The longest path length in the tree

Solution

1. Step 1: Understand the problem definition

   The maximum path sum is the highest sum of values collected by traveling along any path between 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 node value, but the maximum sum along any connected path.

3. Final Answer:

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

4. Quick Check:

   Maximum path sum = largest sum on any node-to-node path [OK]

Hint: Maximum path sum is about any path, not whole tree sum [OK]

Common Mistakes:

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

2. Which of the following C++ function signatures is correct for a recursive function that computes the maximum path sum in a binary tree node structure defined as struct TreeNode { int val; TreeNode* left; TreeNode* right; };?

easy

A. int maxPathSum(TreeNode root);

B. void maxPathSum(TreeNode root);

C. int maxPathSum(TreeNode* root);

D. int maxPathSum(TreeNode* root, int sum);

Solution

1. Step 1: Check parameter passing

   The tree nodes should be passed as pointers to avoid copying the entire subtree, so TreeNode* is correct.

2. Step 2: Check return type and parameters

   The function returns an integer representing the maximum path sum, so int return type is correct. Additional parameters like int sum are not necessary for the main function signature.

3. Final Answer:

   int maxPathSum(TreeNode* root); -> Option C

4. Quick Check:

   Use pointer parameter and int return type [OK]

Hint: Use pointer parameter and int return type for tree recursion [OK]

Common Mistakes:

• Passing TreeNode by value causing copies
• Using void return type when int is needed
• Adding unnecessary parameters in main signature

3. Consider the following C++ code snippet for maximum path sum in a binary tree:

struct TreeNode { int val; TreeNode* left; TreeNode* right; };

int maxSum = INT_MIN;

int dfs(TreeNode* node) {
  if (!node) return 0;
  int left = max(0, dfs(node->left));
  int right = max(0, dfs(node->right));
  maxSum = max(maxSum, node->val + left + right);
  return node->val + max(left, right);
}

int maxPathSum(TreeNode* root) {
  dfs(root);
  return maxSum;
}

// Tree structure:
//       1
//      / \
//     2   3
//
// What is the output of maxPathSum(root)?

medium

A. 5

B. 6

C. 3

D. 1

Solution

1. Step 1: Calculate dfs values for each node

   For leaf nodes 2 and 3, dfs returns their values (2 and 3). For root 1, left=2, right=3, so maxSum = max(INT_MIN, 1+2+3) = 6.

2. Step 2: Return maxSum after dfs completes

   The function returns maxSum = 6, which is the maximum path sum (2 -> 1 -> 3).

3. Final Answer:

   6 -> Option B

4. Quick Check:

   Max path sum = 2 + 1 + 3 = 6 [OK]

Hint: Add node value plus max left and right sums, ignore negatives [OK]

Common Mistakes:

• Ignoring max(0, dfs(...)) causing negative sums
• Returning node->val + left + right instead of max path
• Confusing maxSum update with return value

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

int maxSum = INT_MIN;

int dfs(TreeNode* node) {
  if (!node) return 0;
  int left = dfs(node->left);
  int right = dfs(node->right);
  maxSum = max(maxSum, node->val + left + right);
  return node->val + max(left, right);
}

What is the main issue causing incorrect results?

medium

A. It does not handle null nodes properly

B. It returns the sum of both children instead of max

C. It does not update maxSum correctly

D. It does not ignore negative sums from children

Solution

1. Step 1: Analyze child sums usage

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

2. Step 2: Identify fix for negative sums

   To fix, use max(0, dfs(...)) to ignore negative sums from children, ensuring path sum only increases or stays same.

3. Final Answer:

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

4. Quick Check:

   Use max(0, dfs(child)) to avoid negative sums [OK]

Hint: Always ignore negative child sums with max(0, dfs(child)) [OK]

Common Mistakes:

• Not using max(0, ...) causing negative path sums
• Returning sum of both children instead of max for recursion
• Incorrect maxSum update logic

5. Given a binary tree where nodes can have negative values, how would you modify the standard maximum path sum algorithm to correctly handle the case where the maximum path sum is a single node with a negative value? Choose the best approach.

hard

A. Initialize maxSum with INT_MIN and use max(0, dfs(child)) in recursion

B. Initialize maxSum with 0 and ignore negative node values completely

C. Initialize maxSum with INT_MIN and allow dfs to return negative values without max(0, ...)

D. Initialize maxSum with 0 and always add node values regardless of sign

Solution

1. Step 1: Recall the standard algorithm

   The standard algorithm initializes maxSum to INT_MIN and uses left = max(0, dfs(left)), right = max(0, dfs(right)), updating maxSum = max(maxSum, node.val + left + right). This captures single negative nodes as node.val + 0 + 0.

2. Step 2: Why it handles negatives

   max(0, dfs(child)) prevents extending to negative subtrees but allows dfs to return node.val + 0 (negative if node negative). INT_MIN init captures negative maxima.

3. Step 3: Why A fails

   Without max(0, ...), negative child sums pollute parent updates (e.g., root=-2, left=-3: maxSum wrongly stays -3 instead of -2).

4. Final Answer:

   Initialize maxSum with INT_MIN and use max(0, dfs(child)) in recursion -> Option A

5. Quick Check:

   max(0, dfs(child)) + INT_MIN handles negative single nodes [OK]

Hint: Standard max(0, dfs(child)) + INT_MIN handles negative nodes correctly [OK]

Common Mistakes:

• Omitting max(0, ...) letting negative children reduce parent path sums
• Initializing maxSum with 0 missing negative maxima
• Ignoring all negative nodes