Using Python 3:

I am having trouble creating a binary tree and actually using breadth first search to solve this. Any help would be greatly appreciated. I know that this can be easily solved going from bottom up but the goal is to go top to bottom. Thank you in advance.

Link to the text file of the triangle: https://drive.google.com/file/d/0B23lG851VqEdUzFTU1E1bXhObTA/view

Project Euler net Maximum path sum I Problem 18 By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23. 74 2 4 6 8 59 3 That is, 3+7+ 4 9 23. Find the maximum total from top to bottom of the triangle below: 75 95 64 17 47 82 18 35 87 10 20 04 82 47 65 19 01 23 75 03 34 88 02 77 73 07 63 67 99 65 04 28 06 16 70 92 41 41 26 56 83 40 80 70 33 41 48 72 33 47 32 37 16 94 29 53 71 44 65 25 43 91 52 97 51 14 70 11 33 228 77 73 17 78 39 68 17 57 91 71 52 38 17 14 91 43 58 50 27 29 48 63 66 04 6B89 53 67 30 73 16 69 87 40 31 04 62 98 27 23 09 70 98 73 93 38 53 60 04 23