Create MaximumPathSumBetweenTwoLeafNodes.cpp #2320
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Given a binary tree in which each node element contains a number. Find the maximum possible sum from one leaf node to another leaf node. Note: Here Leaf node is a node which is connected to exactly one different node. Example 1:
Input:
3
/ \
4 5
/ \
-10 4
Output: 16
Explanation: Maximum Sum lies between leaf node 4 and 5. 4 + 4 + 3 + 5 = 16.
Problem
Solution
Changes proposed in this Pull Request :
1.
..
Other changes