Day 29 of 30-Day LeetCode Challenge

Aanchal Patial
1 min readApr 29, 2020

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

For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The path must contain at least one node and does not need to go through the root.

--

--

Aanchal Patial

We never really grow up, we only learn how to act in public