int main(int argc, char *argv[])
{
int arr1[] = { 1, 2, 4, 5, 3, 6 };
int len1 = sizeof(arr1) / sizeof(arr1[0]);
vector<int> pre(arr1, arr1+len1);
int arr2[] = { 4, 2, 5, 1, 6, 3 };
int len2 = sizeof(arr2) / sizeof(arr2[0]);
vector<int> in(arr2, arr2+len2);
Solution s;
print(pre);
print(in);
TreeNode *tree = s.buildTree(pre, in);
cout << tree->val << endl;
cout << tree->right << endl;
Traversal tra;
print(tra.preorder(tree));
print(tra.inorder(tree));
return 0;
}
