//is list empty bool isempty(return head =nullint length(int length struct node *currentfor(current headcurrent !nullcurrent current->nextlength++return length//find link with given key struct nodefind(int key//start from the first link struct nodecurrent head//if list is empty if(head =nullreturn null//navigate through list while(current->key !key//if it is last node if(current->next =nullreturn nullelse //go to next link current current->next