$//$main$.$cpp

#include "SinglyLinkedList.h$"$

#include

#include

#include

using namespace std;

void listRemoveAfter$($LinkedList$*$ list, Node$*$ curNode$)\{$

if $($list $==$ nullptr $||$ list$->$head $==$ nullptr$)\{$

$//$ The list is empty or curNode is nullptr $($head$),$ nothing to remove.

return;

$\}$

if $($curNode $==$ nullptr$)\{$

$//$ If curNode is nullptr, remove the head node.

Node$*$ temp $=$ list$->$head;

list$->$head $=$ list$->$head$->$next;

if $($list$->$head $==$ nullptr$)\{$

$//$ If the list becomes empty, update the tail as well.

list$->$tail $=$ nullptr;

$\}$

delete temp;

$\}$ else $\{$

$//$ Remove the node after curNode.

Node$*$ temp $=$ curNode$->$next;

if $($temp $!=$ nullptr$)\{$

curNode$->$next $=$ temp$->$next;

if $($temp $==$ list$->$tail$)\{$

$//$ If the removed node was the tail, update the tail.

list$->$tail $=$ curNode;

$\}$

delete temp;

$\}$

$\}$

$\}$

string listDescriptor$($LinkedList$*$ list$)\{$

if $($list $==$ nullptr $||$ list$->$head $==$ nullptr$)\{$

return $""$;

$\}$

ostringstream oss;

Node$*$ current $=$ list$->$head;

while $($current $!=$ nullptr$)\{$

oss $$ current$->$person.descriptor$()$ endl;

current $=$ current$->$next;

$\}$

return oss.str$()$;

$\}$

int main$()\{$

LinkedList list;

$//$ Add nodes to the list

Person person$1(1,$ "John", "Doe"$)$;

Person person$2(2,$ "Jane", "Doe"$)$;

Person person$3(3,$ "Mary", "Doe"$)$;

Person person$4(4,$ "Paul", "Doe"$)$;

list.head $=$ new Node$($person$1)$;

list.head$->$next $=$ new Node$($person$2)$;

list.head$->$next$->$next $=$ new Node$($person$3)$;

list.head$->$next$->$next$->$next $=$ new Node$($person$4)$;

list.tail $=$ list.head$->$next$->$next$->$next;

$//$ Test listRemoveAfter

listRemoveAfter$($&list, nullptr$)$; $//$ removes head

listRemoveAfter$($&list, list.head$->$next$)$; $//$ removes tail

$//$ Print the updated list

cout $$ listDescriptor$($&list$)$ endl;

return $0$;

$\}$

$//$singlelinkedlist$.$h

#ifndef SINGLY$\_$LINKED$\_$LIST

#define SINGLY$\_$LINKED$\_$LIST

#include

using namespace std;

$/*$ class: Node $*/$

class Node $\{$

public:

Person$*$ person;

Node$*$ next;

Node$($const Person& p$)$ : person$($p$),$ next$($nullptr$)\{\}$

$\}$;

$/*$ class: LinkedList $*/$

class LinkedList $\{$

public:

Node$*$ head;

Node$*$ tail;

LinkedList$()$ : head$($nullptr$),$ tail$($nullptr$)\{\}$

$\}$;

#endif