This assignment is due Monday, 1 October.
In the 5 September class, I mentioned that the doubly-linked list (Figures 4.14 and 4.15 on page 109) could be implemented without the tail pointer by putting the list into a circle. Your assignment is to make that implementation change.
You need to change only one file, dlist.h, to complete this assignment. (I had to change a little less than twenty lines of the file.) However, you'll need the files Dlistmain.cpp, book.h, compare.h, dlink.h, and list.h to compile and test your code.
The command for compiling the code on a Linux computer, like burnsville.cs.unca.edu is: