Copying List Structures without Auxiliary Storage.

摘要

An algorithm is presented for copying an arbitrary list structure into a block of contiguous storage locations without destroying the original list. Apart from a fixed number of program variables, no auxiliary storage, such as a stack, is used. The algorithm needs no mark bits and operates in linear time. It is shown to be significantly faster than the best previous algorithm for the same problem. (Author)