Node in a single linked list points to the next node by next pointer. Now say we start from head and want to reverse the entire list. This could be possible by reversing the direction of next pointer. To achieve this we require three pointers. One to point previous node another to point the current and one to point to next. Now head will become tail in the reversed list so we take prev pointer as NULL. Current will point to head and next will be Current -> next. Now swap next by pointing next to prev. Move to next node. Prev becomes Current. Current becomes next. and Next is Current ->next. Again point Current->next to Prev. This way shift till next becomes NULL.
Linked List Node location 005F1880 Value 1 Node location 005F18A0 Value 2 Node location 005F18B0 Value 3 Node location 005F8DB8 Value 4 Node location 005F8DC8 Value 5 Node location 005F8DD8 Value 6 Node location 005F8DE8 Value 7 Node location 005F8DF8 Value 8 Node location 005F8E08 Value 9 Node location 005F8E18 Value 10 Linked List reversed Linked List Node location 005F8E18 Value 10 Node location 005F8E08 Value 9 Node location 005F8DF8 Value 8 Node location 005F8DE8 Value 7 Node location 005F8DD8 Value 6 Node location 005F8DC8 Value 5 Node location 005F8DB8 Value 4 Node location 005F18B0 Value 3 Node location 005F18A0 Value 2 Node location 005F1880 Value 1
About our authors: Team EQA
You have viewed 1 page out of 248. Your C learning is 0.00% complete. Login to check your learning progress.
Questions index C Questions C++ Questions Win32 MFC COM/DCOM DLL Questions
Compilers & Editors
Download Visual Studio Download XCode Download Visual Studio Code Android studio install sdk Eclipse installer Best C compilers IDEs
Development system setup
Windows media creation tool MSDN subscription Ubuntu virtualbox
New updated posts
Why learn C? Draw on printer Memory leaks