I have a linked list where the input is read into. The 2 types of input have to go into a queue. 1 queue for each type.
I suppose that the output line of the linked list can be used to read it into the queue ? I know it should be possibile somehow by using cout.
cout<< "List Contains:"<< endl; DisplayList(list) FreeList(list) return 0;
I suppose a dynamic queue. But how? Linked List implementation? The way the book did the linked list implementation is by using a header file. I don't like that, though. Would I just add the delete function, push, pop and isempty? I think that would take care of it. Then I load it into it and work with the input. But how would I split the input? I would have to use a loop to decide what goes where. So how would I use a loop to put the input into the queue?