void traverse1(TreeNode* root, std::vector<int> &path) {
if(root == NULL)
return;
//move.push_back(0);
traverse1(root->right, path);
path.push_back(root->val);
//move.push_back(1);
traverse1(root->left, path);
}
void traverse1(int k)
{
link t;
printf("%d\n", k);
visited[k] = 1;
for(t = adj[k]; t != NULL; t = t->next)
if(!visited[t->v])
traverse1(t->v);
}
std::vector<int> inorderTraversal1(TreeNode* root) {
std::vector<int> path;
traverse1(root, path);
return(path);
}
