Competitive-Programming-and-Contests-VP-Solution

The repository that contains all solutions made for the course Competitive Programming and Contests by the University of Pisa

View the Project on GitHub

Maximum Path Sum between 2 Leaf Nodes

Solved Solution Time :clock11:
:heavy_check_mark: Post Order Visit on BTree 0.37 ms

Solution or Solution discussion

The solution used the post order visit on BTree and make the check to choose the correct path, otherwise if the path don’t exist return the INT32_MIN.