二叉树的建立（先序+中序）

105. Construct Binary Tree from Preorder and Inorder Traversal

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) 
    {
        if(preorder.empty() || inorder.empty())
            return 0;
        return createChildTree(preorder.begin(), preorder.end()-1, inorder.begin(), inorder.end()-1);
    }

    TreeNode* createChildTree(vector<int>::iterator prebegin, vector<int>::iterator preend, vector<int>::iterator inbegin, vector<int>::iterator inend)
    {
        if(prebegin > preend)
            return 0;
        TreeNode* root = new TreeNode(*prebegin);
        if(prebegin == preend)
        {
            return root;
        }

        vector<int>::iterator it = find(inbegin, inend+1, *prebegin);
        int n = distance(inbegin, it) - 1;

        root->left = createChildTree(prebegin+1, prebegin+1+n, inbegin, it-1);
        root->right = createChildTree(prebegin+1+n+1, preend, it+1, inend);
        return root;
     }
};