int List$\_$append$($List$*$ pList, void$*$ pItem$)\{$

assert$($pList $!=$ NULL$)$;

if $($pList$->$size $>=$ LIST$\_$MAX$\_$NUM$\_$NODES$)\{$

return LIST$\_$FAIL; $//$ List is full

$\}$

int newNodeIndex $=$ pList$->$available;

pList$->$available $=$ pList$->$nodes$[$pList$->$available$].$next;

pList$->$nodes$[$newNodeIndex$].$data $=$ pItem;

pList$->$nodes$[$newNodeIndex$].$next $=-1$; $//$ No next node, as it is the last node

if $($pList$->$size $==0)\{$

pList$->$head $=$ newNodeIndex;

$\}$ else $\{$

int lastNodeIndex $=$ pList$->$head;

while $($pList$->$nodes$[$lastNodeIndex$].$next $!=-1)\{$

lastNodeIndex $=$ pList$->$nodes$[$lastNodeIndex$].$next;

$\}$

pList$->$nodes$[$lastNodeIndex$].$next $=$ newNodeIndex;

$\}$

pList$->$size$++$;

return LIST$\_$SUCCESS;

$\}$ without malloc fix thisi code