Find the maximum path sum from root to leaf in a binary tree.

Problem

Given a binary tree, find the maximum path sum from root to leaf.
Example input:
[4, -1, 3]
Example output:
7

Solution

This solution is in C#. Our A.I. can create solutions in multiple languages.

kayakane

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace InterviewPreperationGuide.Core.CrackingTheCodingInterview.c4q8 {
    public class Solution {
        public void Init () {
            Console.WriteLine ();
        }
    }
}