void push(Node *head, char *v){

    Node *new;
    new = malloc(sizeof(Node));
    Node *last = head;

    new->value = v;
    new->next = NULL;

    while(last->next != NULL){
    last=last->next;
}

   last->next=new;

}