106. Construct Binary Tree from Inorder and Postorder Traversal

[LeeMax117]

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

inorder = [9,3,15,20,7] postorder = [9,15,7,20,3]

Return the following binary tree:

3 / \ 9 20 / \ 15 7

• [x] Jinglong's code
• [x] LeeMax's code
• [x] Discuss and imporve

[LeeMax117]

https://github.com/LeeMax117/LeetCode_practise/tree/master/LeeMax/106.%20Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal

[nijilong1224]

https://github.com/LeeMax117/LeetCode_practise/blob/master/Jinglong/buildTree.py