For this assignment, you will be completing the implementation of a variation on the linked list idea that stores its data in two separate orders at once. That is, it stores data in the usual order, based on when it was added by the user. At the same time, however, it keeps track of an ascending sorted order. To achieve this, it uses a Node class that comes with four separate references:
More Details in PDF file.