输入某二叉树的前序遍历和中序遍历的结果,请重建该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。
例如,给出
前序遍历 preorder = [3,9,20,15,7]
中序遍历 inorder = [9,3,15,20,7]
返回如下的二叉树:
3
/ \
9 20
/ \
15 7
链接:https://leetcode-cn.com/problems/zhong-jian-er-cha-shu-lcof
如何找到左子树的根的位置,和右子树根的位置?
/**
* 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:
typedef vector<int>& vv;
TreeNode* buildTreeImpl(vv pre, vv in, int root, int start, int end)
{
if (start > end) return NULL;
TreeNode* troot = new TreeNode(pre[root]);
for (int i = start; i <= end; i++)
{
if (pre[root] == in[i])
{
troot->left = buildTreeImpl(pre, in, root + 1, start, i- 1);
// 这个是怎么算的?需要仔细想想
troot->right = buildTreeImpl(pre, in, root + 1 + i - start, i + 1, end);
break;
}
}
return troot;
}
// https://leetcode-cn.com/problems/zhong-jian-er-cha-shu-lcof/
// 重建二叉树
TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
return buildTreeImpl(preorder, inorder, 0, 0, inorder.size() - 1);
}
};