I think you can pinch ideas from e.g. Java Serialisation, which recognises when pointers point to nodes already serialised, so that it can serialise (and then deserialise) arbitrary structures reasonably efficiently. The spec, which you can download via a link at docs.oracle.com/javase/1.4.2/docs/guide/... says that this is done but doesn't say exactly how - I suspect hash tables.
This is a typical interview question. You can find many answers by using Google. This is a link I think is good for understanding.
But please read the comments too, there are some errors in the main body: Copy a linked list with next and arbit pointer.
I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.