LLL Recursive Insert
	• For example, let’s review what it would be like to insert into a LLL --- adding at the end all of the time: void insert(node * & head, data & d){    if (!head) {        head = new node;        head->d = d;        head->next = NULL;    }    else insert(head->next, d); }