Node* find_last(Node* n)
{
Node* last{n};
if(last->next != nullptr)
return find_last(last->next);
}
return last;