LLL Recursive Insert
	• Another way to write this: node * insert(node * head, data & d){    if (!head) {        head = new node;        head->d = d;        head->next = NULL;        return head;    }    head->next = insert(head->next,d);    return head; }