Question

In Java using a Dynamic Programming technique: Maximum sum of nodes in a binary tree such that no two nodes are adjacent. The dynamic programming part is the part I am having trouble with

Answer 1

import java.util.ArrayList;

public class Main {

public void findMaximumSum(int node, int parent, int dp1[], int dp2[], ArrayList<ArrayList<Integer>> adj, int tree[]) {

int sum1 = 0, sum2 = 0;

for (ArrayList<Integer> adjNodes : adj) {

for (Integer n : adjNodes) {

if (n == parent)

continue;

findMaximumSum(n, node, dp1, dp2, adj, tree);

sum1 += dp2[n];

sum2 += Math.max(dp1[n], dp2[n]);

}

}

dp1[node] = tree[node] + sum1;

dp2[node] = sum2;

}

}