利用前序的第一个数字确定根节点值,中序中该根节点左边是左子树元素,右侧是右子树元素。以此,递归出整棵树。主要是要有子树的思想。
/**
* 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* funt(vector<int>& preorder, int p1, int e1, vector<int>& inorder, int p2,int e2) {
if(p1>e1||p2>e2) return nullptr;
TreeNode *root = new TreeNode(preorder[p1]);
int temp = 0;
while(inorder[p2 + temp]!=preorder[p1]) temp++;
root->left = funt(preorder,p1+1,p1+temp,inorder,p2,p2+temp-1);
root->right = funt(preorder,p1+temp+1, e1,inorder,p2+temp+1,e2);
return root;
}
TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
if(preorder.size()==0) return nullptr;
return funt(preorder,0,preorder.size()-1,inorder,0,inorder.size()-1);
}
};