void insertLast (int num) {
    temp = (node_t*) malloc (sizeof (node_t));
    temp->val = num;
    temp->PREV = last;
    temp->NEXT = NULL;
    if (last!=NULL )last->NEXT = temp;
    else first = temp;
    last = temp;
}