leetcode, LC44: 从前序和中序遍历构造二叉树

本文链接：https://blog.csdn.net/weixin_40883496/article/details/109801800

1 题目描述

给出一棵树的前序遍历和中序遍历，请构造这颗二叉树
注意：
可以假设树中不存在重复的节点

2 解题思路

和从中序和后序遍历构造二叉树一致。

3 代码实现

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 * };
 */

class Solution {
public:
    /**
     * 
     * @param preorder int整型vector 
     * @param inorder int整型vector 
     * @return TreeNode类
     */
    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
        return buildTreeHelper(preorder, 0, preorder.size() - 1, inorder, 0, inorder.size() - 1);
    }
    TreeNode* buildTreeHelper(vector<int>& preorder, int preBegin, int preEnd,vector<int>& inorder, int inBegin, int inEnd){
        if(preBegin > preEnd) return NULL;
        
        TreeNode* root = new TreeNode(preorder[preBegin]);
        int mid;
        for(mid = inBegin; mid <= inEnd; mid++)
            if(inorder[mid] == root->val)
                break;
        int leftSize = mid - inBegin;
        root->left = buildTreeHelper(preorder, preBegin + 1, preBegin + leftSize, inorder, inBegin, mid - 1);
        root->right = buildTreeHelper(preorder, preBegin + leftSize + 1, preEnd, inorder, mid + 1, inEnd);
        return root;
    }
};