int main(){ vector<int> preorder{1, 2, 3, 4, 5, 6}, inorder{3, 2, 4, 1, 5, 6}; Solution2 s; auto res = s.buildTree(preorder, inorder); printTree(res); return 0; }
int main() { Solution2 s; Examples eg; vector<int> a, b; a.push_back(1); a.push_back(2); a.push_back(3); b.push_back(2); b.push_back(3); b.push_back(4); TreeNode* res = s.buildTree(a, b); if (res) cout << res->val << endl; }