GoLang Solution For LeetCode Problem: Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree.
**Note:**You may assume that duplicates do not exist in the tree.
For example, given
postorder = [9,15,7,20,3]
Return the following binary tree:
3 / \ 9 20 / \ 15 7
See the full details of the problem Construct Binary Tree from Inorder and Postorder Traversal at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go