A doubly linked list can be reversed in constant time if the meaning of “previous” and “next” is reversed. Discuss how this idea might be implemented in practice.
this question is call us to implement in algorithm ?
or coding c++?
not really sure about it
what i understand from this question is do a doubly linked list
Discuss how this idea might be implemented in practice.
So it asks only an idea of algorithm implementation, but it should be detailed. So you could write a C++ code from this idea.
In either way it would be ease to discuss about the idea if you have a C++ code for it.