Insertion at the End of the List At this point, your program can insert and delete only from the front of the list (the head node). The result is that data values are stored in descending order from...

Insertion at the End of the List

At this point, your program can insert and delete only from the front of the list (the head node). The result is that data values are stored in descending order from the head node. Data could be stored in ascending order if nodes were inserted at the end of the list instead of from the front. This necessitates a list with a pointer to the tail node as shown in Figure 12-51.

Modify your tutorial project (you can make a copy and rename it) so that all insertions take place at the tail. You do not need to implement node deletion. The typical interface display should show an ordered list, as in Figure 12-52: