(C++ Data Structure) As you can see, below is a function that was mainly created to add a node to the beginning of a queue.

For example: Is-> B -> T -> G and with the function CREATED from below now this one has changed to Is -> J-> B -> T -> G

Here is the main question: How can you add a node to the end of a queue?

Comments are really appreciated.

void AddToFront() { //ne is basically the new listart created to be place at the beginning which is J, in other words ne=J LISTREC* ne; ENTRY part; clscr(); gotoxy[10, 12] printf(" name to add "); scanf(" %[^ ]", part.name); ne = (LISTREC*)malloc(sizeof(LISTREC)); ne->info = part; ne->link = NULL; ne->link = liststart; liststart = ne; printlist(liststart); }//AddToFront