A linear algorithm for copying binary trees using bounded workspace

Authors:
K. P. Lee
Affiliations:
Louisiana State Univ., Baton Rouge
Venue:
Communications of the ACM
Year:
1980

Citing 6
Cited 3

A fast algorithm for copying list structures

Communications of the ACM
A bounded storage algorithm for copying cyclic structures

Communications of the ACM
An exercise in proving parallel programs correct

Communications of the ACM
Copying cyclic list structures in linear time using bounded workspace

Communications of the ACM
Copying list structures using bounded workspace

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

A compendium of key search references

ACM SIGIR Forum
A bibliography on garbage collection and related topics

ACM SIGPLAN Notices
Garbage Collection of Linked Data Structures

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	48.22

Visualization

Abstract

An algorithm to copy a binary tree in linear time using bounded workspace is presented. The algorithm does not modify the original tree at any time. The copy is constructed in such a way that it can be traversed in a read-only fashion even before the copying process is complete, provided one can distinguish between the original and the copy. The traversal can be carried out in parallel with the copying.