struct Node
{
    int info;
    Node * next;
    Node (int val, Node * link)
	: info(val),
	  next(link)
    {
	    
    }
};

int main()
{
    Node * x = new Node(1, new Node(2, new Node(3,x)));
}

Node * vec2list(tvector<int>& v)
{
    Node * front = 0;
    for(int k= v.size()-1; k >= 0; k--){
	front = new Node(v[k],front);
    }
    return front;
    
}

Node * vec2list(tvector<int>& v)
{
    if (v.size() == 0) return 0;
    
    Node * front = new Node(v[0],0);
    Node * last = front;
    for(int k=1; k < v.size(); k++) {
	last->next = new Node(v[k],0);
	last = last->next;
    }
    return front;
    
}