Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal（根据前序、中序遍历序列构造二叉树）

最新推荐文章于 2022-07-01 16:44:07 发布

秀秀的奇妙旅行

最新推荐文章于 2022-07-01 16:44:07 发布

阅读量109

点赞数

文章标签：二叉树 leetcode 算法

本文链接：https://blog.csdn.net/yunxiu988622/article/details/105000164

版权

 Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree,
construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
For example, given
preorder = [3,9,20,15,7]
inorder = [9,3,15,20,7]
Return the following binary tree:
    3
   / \
  9  20
    /  \
   15   7

/**
 * 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) {
        int size=preorder.size();
        if(size==0){
            return NULL;
        }
        vector<int>leftpre,leftin,rightpre,rightin;
        TreeNode*root=new TreeNode(preorder[0]);
        int number=0;
        for(int i=0;i<size;i++){
            if(preorder[0]==inorder[i]){
                number=i;
                break;
            }
        }
        for(int i=0;i<number;i++){
            leftpre.push_back(preorder[i+1]);
            leftin.push_back(inorder[i]);
        }
        for(int i=number+1;i<size;i++){
            rightpre.push_back(preorder[i]);
            rightin.push_back(inorder[i]);
        }
        root->left=buildTree(leftpre,leftin);
        root->right=buildTree(rightpre,rightin);
        return root;
    }
};