Method maxiPathSum

TreeMaximumPathSumBinaryTree.java:9–17

(TreeNode root, int arr[])

    }
    
    public int maxiPathSum(TreeNode root, int arr[])
    {
        if(root == null ) return 0;
        
        int leftSum = Math.max(maxiPathSum(root.left,arr),0);
        int rightSum = Math.max(maxiPathSum(root.right,arr),0);
        arr[0] = Math.max(arr[0],root.val + leftSum+rightSum);
        return root.val + Math.max(leftSum,rightSum);
    }
}