LeetCode面试题07. 重建二叉树

面试题07. 重建二叉树

解题思路：

通过前序遍历找根节点，找到根节点后，再中序遍历中找当前根节点，找到后，左边的节点是当前根节点的左子树中的节点，右边的节点是当前根节点右子树的节点。递归建树。

例如：

代码：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
struct TreeNode* construct(int* preorder, int preleft,int preright, int* inorder, int inleft,int inright){
    int i,leftson;
    if(preleft>preright)return NULL;
    struct TreeNode* root=(struct TreeNode*)malloc(sizeof(struct TreeNode));
    root->val=preorder[preleft];
    for(i=inleft;i<=inright;i++){
        if(inorder[i]==root->val)break;
    }
    leftson=i-inleft;
    root->left=construct(preorder,preleft+1,preleft+leftson,inorder,inleft,i-1);
    root->right=construct(preorder,preleft+leftson+1,preright,inorder,i+1,inright);
    return root;
}

struct TreeNode* buildTree(int* preorder, int preorderSize, int* inorder, int inorderSize){
    return construct(preorder, 0, preorderSize - 1, inorder, 0 ,inorderSize - 1);
}