#include <iostream>

using namespace std;

struct binary_tree_node{

    int value;

    binary_tree_node*  left;

    binary_tree_node*  right;

};

binary_tree_node* binary_tree_constuct(int* preorder, int* inorder, int length);

int main()

{

    int pre[] = {,,,,,,,};

    int in[]  = {,,,,,,,};

    binary_tree_node* root = binary_tree_constuct(pre, in, );

}

binary_tree_node* construct_method(int* preorder, int* endpreorder, int* inorder, int* endinorder)

{

    int root_value = preorder[];

    binary_tree_node* root = new binary_tree_node();

    root->left = NULL;

    root->right = NULL;

    cout<<root_value<<" ";

    if(preorder == endpreorder && inorder == endinorder)

        return root;

    int* rootIndex = preorder;

    rootIndex++;

    while(*rootIndex != root_value && rootIndex < endpreorder)

        rootIndex++;

    int left_len = rootIndex - preorder;

    int* left_preorder_end = preorder + left_len;

    //left

    if(left_len > )

    {

        root->left = construct_method(preorder+, left_preorder_end, inorder, rootIndex-);

    }

    //right

    if(left_len < endpreorder - preorder)

    {

        root->right = construct_method(left_preorder_end+, endpreorder, rootIndex+, endinorder);

    }

    return root;

}

binary_tree_node* binary_tree_constuct(int* preorder, int* inorder, int length)

{

    if(preorder == NULL || inorder == NULL || length <= )

    {

        return NULL;

    }

    return construct_method(preorder, preorder+length-, inorder,inorder+length-);

}