GoLang Solution For LeetCode Problem: Binary Tree Postorder Traversal
Solving Binary Tree Postorder Traversal in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Given a binary tree, return the postorder traversal of its nodes' values.
Input: [1,null,2,3] 1 \ 2 / 3 Output: [3,2,1]
Follow up: Recursive solution is trivial, could you do it iteratively?
See the full details of the problem Binary Tree Postorder Traversal at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go