《劍指offer》重建二叉樹

題目：輸入某二叉樹的前序遍歷和中序遍歷的結果，請重建出該二叉樹。假設輸入的前序遍歷和中序遍歷的結果中都不含重復的數字。例如輸入前序遍歷序列{1,2,4,7,3,5,6,8}和中序遍歷序列{4,7,2,1,5,3,8,6}，則重建二叉樹並返回。

 

代碼（c/c++）:

#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
struct TreeNode {
      int val;
      TreeNode *left;
      TreeNode *right;
      TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
TreeNode* reConstructBinaryTree(vector<int> pre, vector<int> vin) 
{
    
    int pre_len = pre.size();
    int in_len = vin.size();
    if(pre_len == 0 || in_len == 0 || pre_len != in_len)
        return NULL;
    TreeNode *head = new TreeNode(pre[0]);//創建根節點
    int root_ind = 0;//記錄root在中序中的下標
    for(int i = 0; i<pre_len; i++){
        if(vin[i] == pre[0]){
            root_ind = i;
            break;
        }
    }
    vector<int> in_left, in_right,pre_left, pre_right;
    for(int j = 0; j<root_ind; j++){
        in_left.push_back(vin[j]);
        pre_left.push_back(pre[j+1]);//第一個為根根節點，跳過
    }
    for(int j = root_ind+1; j<pre_len; j++){
        in_right.push_back(vin[j]);
        pre_right.push_back(pre[j]);
    }
    //遞歸
    head->right = reConstructBinaryTree(pre_right, in_right);
    head->left = reConstructBinaryTree(pre_left, in_left);
    return head;
}
//中序遍歷，可以查看是否重建成功
void inorderTraverseRecursive(TreeNode *root)
{
    if(root != NULL){
        inorderTraverseRecursive(root->left);
        cout<<root->val<<" ";
        inorderTraverseRecursive(root->right);
    }
}
int main(){
    int pre[] = {1,2,4,7,3,5,6,8};
    int in[] =  {4,7,2,1,5,3,8,6};
    vector<int> pre_vec(pre, pre+8);
    vector<int> in_vec(std::begin(in), std::end(in));
    // for(auto item: pre_vec)
    //     cout<<item<<' '<<endl;
    // for(auto item: in_vec)
    //     cout<<item<<' '<<endl;
    TreeNode *head ;
    head = reConstructBinaryTree(pre_vec, in_vec);
    inorderTraverseRecursive(head);
    return 0;
}