How do you reverse a linked list without using any C pointers?
October 28, 2007 · Filed Under C Interview Questions, Placement Questions
 Don't want to miss a single bit? Subscribe By Email for Daily Jobs |
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).
Related Articles
- How do you reverse a linked list without using any C pointers?
- How do you reverse a singly linked list? How do you reverse a doubly linked list? Write a C program to do the same.
- How do you reverse a singly linked list? How do you reverse a doubly linked list? Write a C program to do the same.
- How would you detect a loop in a linked list? Write a C program to detect a loop in a linked list.How would you detect a loop in a linked list? Write a C program to detect a loop in a linked list.
- How would you find out if one of the pointers in a linked list is corrupted or not?
-
Subscribe
-
Job In Companies
-
Latest Jobs- TCS Freshers Walkin Banking Jobs - TCS BPO
- Sutherland Freshers Walkin
- Syntel Freshers Walkin
- Citigroup Freshers Walkin Jan 6 - 7
- NVIDIA Corp Recruits Freshers Senior Hardware Engineer
- BA Continuum Sol Recruits Freshers Tech Associate
- Convergys Recruits Freshers Technician - Network Services
- Bose Recruits Freshers TECHNICIAN
- RR Donnelley Recruits Freshers Customer Service Executive
- Zensar Tech Recruits Freshers Customer Service Executives