Comments on: Printing linked List in Reverse without Reversing The List Actually http://www.openasthra.com/c-tidbits/printing-linked-list-in-reverse-without-reversing-the-list-actually/ C/C++ Programming Blog Fri, 21 Nov 2008 23:15:49 +0000 http://wordpress.org/?v=2.3.1 By: Alek http://www.openasthra.com/c-tidbits/printing-linked-list-in-reverse-without-reversing-the-list-actually/#comment-27251 Alek Tue, 12 Aug 2008 23:56:01 +0000 http://www.openasthra.com/c-tidbits/printing-linked-list-in-reverse-without-reversing-the-list-actually/#comment-27251 wouldn't the stack version not print the last element in the list but would instead start with the second to last since, tmpnode = Pop(stack); //here tmpnode is the last node while(tmpnode) { tmpnode = Pop(stack); // now tempnode is the 2nd to last node printf("%d -> ", tmpnode->info); } to fix this just add a printf("%d -> ", tmpnode->info); before the while loop right? wouldn’t the stack version not print the last element in the list but would instead start with the second to last since,

tmpnode = Pop(stack);
//here tmpnode is the last node

while(tmpnode)
{
tmpnode = Pop(stack);
// now tempnode is the 2nd to last node
printf(”%d -> “, tmpnode->info);
}

to fix this just add a printf(”%d -> “, tmpnode->info); before the while loop

right?

]]>