GoLang Solution For LeetCode Problem: Path Sum II
Solving Path Sum II in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Problem Description
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.
Example:
5
/ \
4 8
/ / \
11 13 4
/ \ / \
7 2 5 1
Return:
[
[5,4,11,2],
[5,8,4,5]
]
See the full details of the problem Path Sum II at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go
Comments
Leave a comment
You are not LoggedIn but you can comment as an anonymous user which requires manual approval. For better experience please Login.