GoLang Solution For LeetCode Problem: Path Sum
Solving Path Sum in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.
5 / \ 4 8 / / \ 11 13 4 / \ \ 7 2 1
See the full details of the problem Path Sum at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go