Maximum Sum path between two leaves

__________________________________________________

**Top Companies Interview Questions..-**

Microsoft | Amazon | more.. |

If you find anything incorrect or you feel that there is any better approach to solve the above problem, please write comment.

__________________________________________________

### Related Posts:

- Get the Sum of all left leaves in a Binary tree
- Diameter Of a Binary Tree
- Print All Paths From Root In a Binary Tree Whose Sum is Equal to a Given Number
- Dynamic Programming – Maximum Subarray Problem
- Dynamic Programming – Minimum Cost Path Problem
- Dynamic Programming – Maximum size square sub-matrix with all 1s
- Maximum difference between two elements where larger element appears after the smaller…
- Dynamic Programming – Maximum Product Cutting Problem.
- Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer
- Backtracking – Knight’s Tour Problem