(algorithm) Binary Tree Max Path Sum

Topic:

Given a binary tree, find the maximum path sum.

For this problem, a path was defined as any sequence of nodes from some starting node to any node in the tree along the par Ent-child connections. The path does not need to go through the root.

For example:
Given the below binary tree,

       1      /      2   3

Return 6 .

Ideas:

Recursive

Code:

#include <iostream>#include<stdlib.h>using namespacestd;structtreenode{intVal; TreeNode*Left ; TreeNode*Right ;};intMaxpathsum (TreeNode *root,int&maxDist) {    if(root==NULL)return 0; intLmax=maxpathsum (root->left,maxdist); intRmax=maxpathsum (root->right,maxdist); if(lmax+rmax+root->val>maxDist) MaxDist=lmax+rmax+root->Val; returnMax0, root->val+Max (Lmax,rmax));}intMain () {return 0;}

(algorithm) Binary Tree Max Path Sum