Get rid of the c$++$ stuff in his code so it is just in C $($the code is down below$).$ Use the linked list code $($put it into your IDE$)$ and then do a very simple demo of you using it to build a linked list $($ like he did $)$ Make sure to show your source code and output for that and some comments to explain what your code is doing $!!$

#include

#include

#include "List.h$"$

using namespace std;

List::List$()\{$

head $=$ NULL;

curr $=$ NULL;

temp $=$ NULL;

$\}$

void List::AddNode$($int addData$)\{$

nodePtr n $=$ new node;

n$->$next $=$ NULL;

n$->$data $=$ addData;

if$($head $!=$ NULL$)\{$

curr $=$ head;

while$($curr$->$next $!=$ NULL$)\{$

curr $=$ curr$->$next;

$\}$

curr $->$next $=$ n;

$\}$

else

$\{$

head $=$ n;

$\}$

$\}$

void List::DeleteNode$($int delData$)\{$

nodePtr delPtr $=$ NULL;

temp $=$ head;

curr $=$ head;

while$($curr $!=$ NULL && curr$->$data $!=$ delData$)\{$

temp $=$ curr;

curr $=$ curr$->$next;

$\}$

if$($curr $==$ NULL$)\{$

cout $<<$ delData $<<$ "was not in the list

$"$;

delete delPtr;

$\}$

else$\{$

delPtr $=$ curr;

curr $=$ curr$->$next;

temp$->$next$=$ curr;

if$($delPtr $==$ head$)\{$

head $=$ head$->$next;

temp $=$ NULL;

$\}$

delete delPtr;

cout $<<$ "The value" $<<$ delData $<<$ "was deleted

$"$;

$\}$

$\}$

void List::PrintList$()\{$

curr $=$ head;

while$($curr $!=$ NULL$)$

$\{$

cout $<<$ curr $->$data $<<$ endl;

curr $=$ curr$->$next;

$\}$

$\}$

#include

#include "List.h$"$

using namespace std;

int main$($int argc, char$**$ argv$\{$

List Rachael;

Rachael.AddNode$(3)$;

Rachael.AddNode$(5)$;

Rachael.AddNode$(7)$;

Rachael.PrintList$()$;

Rachael.DeleteNode$(5)$;

Rachael.PrintList$()$;

return $0$;

$\})$

#ifndef LIST$\_$H

#define LIST$\_$H

class List $\{$

private:

typedef struct node $\{$

int data;

node$*$ next;

$\}*$nodePtr;

nodePtr head;

nodePtr curr;

nodePtr temp;

public: $//$This is where the functions go

List$()$;

void AddNode$($int addData$)$;

void DeleteNode$($int delData$)$;

void PrintList$()$;

$\}$;

#endif

Linked list demo

#include

#include

#include

typedef struct node $\{$

char $*$data;

struct node $*$next;

$\}*$ nodePtr;

void printlist$($nodePtr l$)\{$

nodePtr curr $=$ l;

printf$("$THE LIST IS:

$")$;

while $($curr $!=$ NULL$)\{$

printf$("\%$s

$",$ curr$->$data$)$;

curr $=$ curr$->$next;

$\}$

printf$("$

$")$;

$\}$

nodePtr addnode$($nodePtr head, char $*$data$)\{$

$//$ create a new node

nodePtr n $=$ malloc$($sizeof$($struct node$))$;

n$->$data $=$ data;

n$->$next $=$ NULL;

$//$ first guy in the list

if $($head $==$ NULL$)\{$

head $=$ n;

return head;

$\}$

$//$ hope along to the last guy

nodePtr curr $=$ head;

while $($curr$->$next $!=$ NULL$)\{$

curr $=$ curr$->$next;

$\}$

$//$ glue him on

curr$->$next $=$ n;

return head;

$\}$

int main$()$

$\{$

nodePtr head $=$ NULL;

$//$ lets add a few things to the list

head $=$ addnode$($head$,$ "Once upon"$)$;

printlist$($head$)$;

head $=$ addnode$($head$,$ "a time"$)$;

printlist$($head$)$;

head $=$ addnode$($head$,"$in Hollywood"$)$;

printlist$($head$)$;

$//$ lets construct a string out of some stuff and add it to the list

double x $=25\mathrm{.}567$;

char s$[80]$;

char xstr$[80]$;

strcpy$($s$,"$My lucky number $")$;

sprintf$($xstr$,"\%\mathrm{.}2$lf$",$ x$)$;

strcat$($s$,$ xstr$)$;

head $=$ addnode$($head$,$ s$)$;

printlist$($head$)$;

return $0$;

$\}$

Another example of Linked List Demo

#define $\_$CRT$\_$SECURE$\_$NO$\_$WARNINGS

#include

#include

typedef struct node $\{$

char val;

struct node $*$ next;

$\}$ node$\_$ptr;

void add$($node$\_$ptr $*$ head, char val$)\{$

node$\_$ptr $*$ current $=$ head;

while $($current$->$next $!=$ NULL$)\{$

current $=$ current$->$next;

$\}$

$/*$ now we can add a new variable $*/$

current$->$next $=($node$\_$ptr $*)$ malloc$($sizeof$($node$\_$ptr$))$;

current$->$next$->$val $=$ val;

current$->$next$->$next $=$ NULL;

$\}$

void print$\_$list$($node$\_$ptr $*$ head$)\{$

node$\_$ptr $*$ current $=$ head;

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

printf$("\%$c

$",$ current$->$val$)$;

current $=$ current$->$next;

$\}$

$\}$

int main$()$

$\{$

node$\_$ptr $*$ head $=$ NULL;

head $=($node$\_$ptr $*)$ malloc$($sizeof$($node$\_$ptr$))$;

if $($head $==$ NULL$)\{$

return $1$;

$\}$

head$->$val $=\text{'}$A$\text{'}$;

head$->$next $=$ NULL;

add$($head$,\text{'}$B$\text{'})$;

add$($head$,\text{'}$C$\text{'})$;

add$($head$,\text{'}$D$\text{'})$;

print$\_$list$($head$)$;

return $0$;

$\}$