SDE Sheet - Maximum Path Sum

This video is part of the Binary Tree section under GFG SDE Sheet.

Given a binary tree in which each node element contains a number. Find the maximum possible path sum from one special node to another special node.

Note: Here special 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 special node 4 and 5. 4 + 4 + 3 + 5 = 16.

Try it out before watching the implementation of the problem in the video. We recommend watching the video, even if you can solve the problem. You may discover something new. All the best!!!

Do check out:-
Problem: https://www.geeksforgeeks.org/problems/maximum-path-sum/1
SDE Sheet Link: https://www.geeksforgeeks.org/sde-sheet-a-complete-guide-for-sde-preparation/
Article Link: https://www.geeksforgeeks.org/find-maximum-path-sum-two-leaves-binary-tree/