Given preorder and inorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
解题思路:
1. 寻找前序遍历序列preorder中的第一个值,在中序遍历序列inorder中的位置inRootPos,将此值设为根节点
2. 计算inorder中的左子树节点个数leftSize = inRootPos - in_first
3. 将preorder中的起始位pre_first+1开始的leftSize个节点的左子树,与inorder中的in_first开始对应的左子树,继续按步骤操作,返回值设为root的左孩子节点。
4. 将preorder中的右子树,与inorder中的对应的右子树,继续按步骤操作,返回值设为root的右孩子节点。
5. 返回root。
/**
* 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) {
return buildTree(begin(preorder), end(preorder), begin(inorder), end(inorder));
}
template<typename InputIterator>
TreeNode* buildTree(InputIterator pre_first, InputIterator pre_last,
InputIterator in_first, InputIterator in_last) {
if (pre_first == pre_last) return nullptr;
if (in_first == in_last) return nullptr;
auto root = new TreeNode(*pre_first);
auto inRootPos = find(in_first, in_last, *pre_first);
auto leftSize = distance(in_first, inRootPos);
root->left = buildTree(next(pre_first), next(pre_first, leftSize + 1),
in_first, inRootPos);
root->right = buildTree(next(pre_first, leftSize + 1), pre_last,
next(inRootPos), in_last);
return root;
}
};