Hi
I'm having trouble completing the function void list::displayReverse() which basically displays the elements in the linked list in reverse. I have tried every possible way but it just doesn't seem to work. It has to bone through a singly linked list. The function is associated with the struct
andCode:struct node { int data; node *next; };
the class private functions
Can someone assist me in thisCode:private : node *first; // start of list node *last; // last in list
Thanks.
Last edited by Salem; 11-06-2010 at 04:34 AM. Reason: Removed pointless size tags, added essential code tags
I don't know what is point of creating a custom linked list if it already exists, I assume it is your homework.
To iterate through list in reverse, you need to supply an additional field:
Otherwise you have two choices:Code:node *previous
1. Create a temporary array and iterate through the list gathering node pointers. Then iterate through array in reverse.
2. Get size of the list, and access n-th element, (n-1)-th, (n-2)-th etc, which gives O(n^2) complexity.
kmdv completey skipped over the simple and obvious and most likely correct choice for this scenario:
Do it recursively! Seriously it's like a 3-line function body if you do this
My homepage
Advice: Take only as directed - If symptoms persist, please see your debugger
Linus Torvalds: "But it clearly is the only right way. The fact that everybody else does it some other way only means that they are wrong"
Hm... right
Ah yes, the "recursive" answer is a good homework answer without actually being a good answer.
What happens when your list length exceeds your stack space to store a recursive call per node?
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
