Given an input.txt that represents a linked list a -> b -> c -> d -> e as a series of nodes with next pointers:
a>b
b>c
c>d
d>e
Reverse the linked list such that the output reads:
e>d
d>c
c>b
b>a
Given an input.txt that represents a linked list a -> b -> c -> d -> e as a series of nodes with next pointers:
a>b
b>c
c>d
d>e
Reverse the linked list such that the output reads:
e>d
d>c
c>b
b>a