revnopointer.txt

来自「It is an ebook about data structures,mai」· 文本 代码 · 共 11 行

How do you reverse a linked list without using any C pointers? 

Discuss it!          


One way is to reverse the data in the nodes without changing the pointers themselves. One can also create a new linked list which is the reverse of the original linked list. A simple C program can do that for you. Please note that you would still use the "next" pointer fields to traverse through the linked list (So in effect, you are using the pointers, but you are not changing them when reversing the linked list).