construct-binary-tree-from-inorder-and-postorder-traversal.js

/**
 * Source:  https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/
 * Tags:    [Tree,Array,Depth-first Search]
 * Level:   Medium
 * Title:   Construct Binary Tree from Inorder and Postorder Traversal
 * Auther:  @imcoddy
 * Content: Given inorder and postorder traversal of a tree, construct the binary tree.
 *
 * Note:
 * You may assume that duplicates do not exist in the tree.
 *
 *
 *
 *                   Subscribe to see which companies asked this question
 *
 *
 *
 *
 *
 *
 *
 *
 *
 *
 *
 *
 *                   Show Similar Problems
 *
 *
 *                      (M) Construct Binary Tree from Preorder and Inorder Traversal
 */

/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {number[]} inorder
 * @param {number[]} postorder
 * @return {TreeNode}
 */
var buildTree = function(inorder, postorder) {

};