int weights_of_nodes[] = {8, 7, 3, 4, 1, 5, 1, 5, 1};

I want to find minimum cost path with JAVA implementation by using dynamic programming, from root to leaf, with using:

left-node-> 2*index+1

right-node->2*index+2

For example: cost of 8-3-1: 12 cost of 8-7-1: 16 cost of 8-7-4-5: 24

I want to find minimum cost path with JAVA implementation by using DYNAMIC PROGRAMMING, from root to leaf

8 3 4 1 6 1) 5 1