【2019秋冬】【剑指offer】重建二叉树

最新推荐文章于 2022-04-07 23:10:09 发布

之井

最新推荐文章于 2022-04-07 23:10:09 发布

阅读量185

点赞数

分类专栏：剑指offer 2019秋冬

本文链接：https://blog.csdn.net/mdzz_z/article/details/104356681

版权

剑指offer 同时被 2 个专栏收录

94 篇文章 0 订阅

订阅专栏

2019秋冬

90 篇文章 0 订阅

订阅专栏

/**
 * 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 n = inorder.size();
        return build(preorder,inorder,0,0,n-1);
    }
    TreeNode* build(vector<int>& preorder,vector<int>& inorder,int prel, int inl, int inr){
        if(inl > inr) return NULL;
        TreeNode *tree = new TreeNode(preorder[prel]);
        int i = inl;
        while(i<inr&&inorder[i]!=preorder[prel]) i++;
        tree->left = build(preorder,inorder, prel+1,inl,i-1);
        tree->right = build(preorder,inorder, prel+i-inl+1,i+1,inr);
        return tree;
    }

};

复习建树，这是LeetCode用指针的写法，思路都是一样的，多体会递归进去的值
树专项总结
数组版建树：

int build(int prel, int inl, int inr){
	if(inl > inr) return -1;
	int i = inl;
	int root = prel;
	while(i<inr&&in[i]!=pre[prel]) i++;
	tree[root].lc = build(prel+1,inl,i-1);
	tree[root].rc = build(prel+i-inl+1,i+1,inr);
	tree[root].id = pre[prel];
	return root;
}