Minimum Sum

Given below is a tree like structure (where each successive row will contain two more nodes) as shown below: 1 5 3 2 7 4 6 9 8 You have to select a node in each row such that the sum of all the nodes selected is minimum. However you are given number “m” and “n” such that if a particular node is chosen in some row, the adjacent node (in the row above or row below) to be selected is at most “m” un