1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32

class Solution { private: TreeNode* generateTree(int preStart, int inStart, int inEnd, vector<int>& preorder, vector<int>& inorder) { if(preStart > preorder.size()1  inStart > inEnd) return NULL; TreeNode* root = new TreeNode(preorder[preStart]); int inIndex = 0; for(int i = inStart; i <= inEnd; i++) { if(inorder[i] == preorder[preStart]){ inIndex = i; break; } } root>left = generateTree(preStart+1, inStart, inIndex1, preorder, inorder); root>right = generateTree(preStart+inIndexinStart+1, inIndex+1, inEnd, preorder, inorder); return root; }
public: TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) { return generateTree(0, 0, inorder.size()1, preorder, inorder); } };
