[LeetCode 105] Construct Binary Tree from Preorder and Inorder Traversal

原文地址：http://blog.csdn.net/benbenab/article/details/8139440

Given preorder and inorder traversal of a tree, construct the binary tree.

Note:
You may assume that duplicates do not exist in the tree.

我：先序的第一个节点是根节点，根节点将中序序列分为左右子树。利用中序序列得出左右子树的节点个数，将先序序列分成左右子树两部分，子树的第一个节点就是左右子树的根节点。

/**
 * 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.size()<=0)
            return NULL;
        if(preorder.size()!=inorder.size())
            return NULL;
        TreeNode* root=new TreeNode(0);
        root=buildTree(preorder,0,preorder.size()-1,inorder,0,inorder.size()-1);
        return root;
    }
    TreeNode* buildTree(vector<int> &preorder,int preStart,int preEnd,vector<int> &inorder,int inStart,int inEnd)
    {
        if(preEnd<preStart)
            return NULL;
        TreeNode* root=new TreeNode(0);
        root->val=preorder.at(preStart);
        if(preEnd==preStart)
            return root;
        int i;
        for(i=0;i<inorder.size();i++)
            if(inorder.at(inStart+i)==root->val)
                break;
        root->left=buildTree(preorder,preStart+1,preStart+i,inorder,inStart,inStart+i-1);
        root->right=buildTree(preorder,preStart+1+i,preEnd,inorder,inStart+i+1,inEnd);
        return root;
    }
};