GoLang Solution For LeetCode Problem: Binary Tree Right Side View
Solving Binary Tree Right Side View in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
Input: [1,2,3,null,5,null,4] Output: [1, 3, 4] Explanation: 1 <--- / \ 2 3 <--- \ \ 5 4 <---
See the full details of the problem Binary Tree Right Side View at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go