"A Linear Algorithm for Copying Binary Trees Using Bounded Workspace."

K. P. Lee (1980)

> Home

Details and statistics

DOI: 10.1145/358826.358835

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cacm/Lee80
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cacm/Lee80
K. P. Lee:
A Linear Algorithm for Copying Binary Trees Using Bounded Workspace. Commun. ACM 23(3): 159-162 (1980)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.