Hi I am new to C++. There are two problems I am having an issue solving.

The first one is :

Design a date structure to store the triangle of numbers. Each node is connected to the two adjacent ones below. example:

5

10 12

55 66 75

88 99 25 33

Part two. Find an algorithm that will find the maximum sum of any decending path from the apex to the base of the triangle example:

5

10 12

55 66 75

88 99 25 33

5+12+66+99

Part 1 and two needs to be solved in two different algorithms, ie they cant be combined to solve both.

Also can you recommend any references that I could read up on the previous questions? I am new to C++.

Thank you kindly.

The first one is :

Design a date structure to store the triangle of numbers. Each node is connected to the two adjacent ones below. example:

5

10 12

55 66 75

88 99 25 33

Part two. Find an algorithm that will find the maximum sum of any decending path from the apex to the base of the triangle example:

5

10 12

55 66 75

88 99 25 33

5+12+66+99

Part 1 and two needs to be solved in two different algorithms, ie they cant be combined to solve both.

Also can you recommend any references that I could read up on the previous questions? I am new to C++.

Thank you kindly.

i was going to suggest something, but the instructions say to design a data structure.

consider looking up a doubly linked list.

consider looking up a doubly linked list.

Topic archived. No new replies allowed.