Google | Onsite | Binary Tree Maximum Even Path Sum
Anonymous User
1840
GoogleInterview

Given a non-empty binary tree, find the maximum even path sum.

Example 1:

Input:
       10
     /    \
    2      5
   /  \      \
  1   101    13

Output: 118
Explanation: 101 + 2 + 10 + 5 = 118
Comments (7)