W
William R.
Question for those who can help me interpret the following exercise
from the book "Algorithms in C", by Robert Sedwewick
"Exercise:
3.37 Implement a code fragment for a linked list that exchanges the
positions of the nodes after the nodes referenced by two given links t
and u."
Does the exercise want me to swap the links t and u? (Not structure
data, but just pointers in the list).
->[t]->->[v] Will become ->->[t]->[v]
Any insight into what this question is asking would be appreciated.
Thanks,
William R.
from the book "Algorithms in C", by Robert Sedwewick
"Exercise:
3.37 Implement a code fragment for a linked list that exchanges the
positions of the nodes after the nodes referenced by two given links t
and u."
Does the exercise want me to swap the links t and u? (Not structure
data, but just pointers in the list).
Any insight into what this question is asking would be appreciated.
Thanks,
William R.