Binary Tree Maximum Path Sum

A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. Note that the path does not need to pass through the root.

The path sum of a path is the sum of the node's values in the path.

Given the root of a binary tree, return the maximum path sum of any non-empty path.

for this problem I have provided the code and the visual walkthrough of how the algorithm performs.

Example:

The Code:

Visual Walkthrough

for a better quality image follow this link the image is on page 2:

https://www.canva.com/design/DAGW0KnXStQ/ATe3pYzBeDOMFzS-ZfBLVA/edit?utm_content=DAGW0KnXStQ&utm_campaign=designshare&utm_medium=link2&utm_source=sharebutton