In Python :

I need to create a binary tree and use breadth first search to solve this. . I know that this can be easily solved going from bottom up but the goal is to go top to bottom.I know there might be some need of adjacency lists but i just dont know how exactly to implement. Thank you in advance.

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