// Source : https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal 
// Author : codeyu 
// Date : 2017年12月14日 14:56:40 

/**********************************************************************************
*
* Given inorder and postorder traversal of a tree, construct the binary tree.
* 
* Note:
* You may assume that duplicates do not exist in the tree.
* 
*
**********************************************************************************/

using System;
using System.Collections.Generic;
using Algorithms.Utils;
namespace Algorithms
{
/**

 * Definition for a binary tree node.

 * public class TreeNode {

 *     public int val;

 *     public TreeNode left;

 *     public TreeNode right;

 *     public TreeNode(int x) { val = x; }

 * }

 */

public class Solution106 {

    public static TreeNode BuildTree(int[] inorder, int[] postorder) {

       throw new NotImplementedException("TODO"); 

    }

}}