GoLang Solution For LeetCode Problem: Find Largest Value in Each Tree Row
Solving Find Largest Value in Each Tree Row in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Problem Description
You need to find the largest value in each row of a binary tree.
Example:
Input:
1
/ \
3 2
/ \ \
5 3 9
Output: [1, 3, 9]
See the full details of the problem Find Largest Value in Each Tree Row 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.