Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6564 |

@blackshadows | 6400 |

@mb1973 | 5785 |

@Quandray | 5275 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5074 |

@kirtidee18 | 4639 |

@sanjay05 | 3762 |

@mantu_singh | 3712 |

@gfgaccount | 3627 |

@marius_valentin_dragoi | 3525 |

Complete Leaderboard | |

Handle | Score |

@yaswanthero123 | 625 |

@vikash619 | 611 |

@venkat11803610 | 501 |

@roshan13ar | 396 |

@DevangSingh | 379 |

@ravi11815721 | 312 |

@hrishipangavhane | 286 |

@aryanjain85297 | 280 |

@kommaraju11806903 | 277 |

@infosumitraut | 272 |

@ankitsharma5422 | 256 |

Complete Leaderboard |

Given a binary tree, the task is to find the maximum path sum. The path may start and end at any node in the tree.

**Example 1:**

**Input:
** 10
/ \
2 -25
/ \ / \
20 1 3 4
**Output: **32**
Explanation: **Path in the given tree goes
like 10 , 2 , 20 which gives the max
sum as 32.

**Example 2:**

**Input:
** 10
/ \
2 5
\
-2
**Output: **17**
Explanation: **Path in the given tree goes
like 2 , 10 , 5 which gives the max sum
as 17.

**Your Task:**

You don't need to take input or print anything. Your task is to **complete **the function **findMaxSum() **that takes **root **as input and returns max sum between any two nodes in the given Binary Tree.

**Expected Time Complexity: **O(N).

**Expected Auxiliary Space: **O(Height of the Tree).

**Constraints:**

1 ≤ Number of nodes ≤ 10^{3}

1 ≤ |Data on node| ≤ 10^{4}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Maximum path sum from any node

...