Maximum Sum Path Binary Tree Problem
Published in
Nov 4, 2023
Given the root of a binary tree, return the maximum sum path from the root node to any leaf node in the binary tree.
Input:
Output: [1, 3, 5, 9]
Explanation: The maximum sum path is [1 -> 3 -> 5 -> 9] having sum 18.
In case multiple paths exists with the maximum sum, the solution can return any one of them.
Practice link: https://www.techiedelight.com/?problem=MaximumSumPathBinaryTree