Maximum sum path in the binary tree
Given an algorithm for finding the level that has maximum sum in the binary tree.
Source Code:
Github: BinaryTreeLevelMaxSumFinder.java
Output:
1 / \ / \ / \ / \ / \ / \ / \ / \ 2 3 / \ / \ / \ / \ 4 5 / / / / 8 6 \ 7 Diameter is : 14