"An Insertion Algorithm for a Minimal Internal Path Length Binary Search Tree."

Thomas E. Gerasch (1988)

> Home

Details and statistics

DOI: 10.1145/42411.42421

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/Gerasch88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cacm/Gerasch88
Thomas E. Gerasch:
An Insertion Algorithm for a Minimal Internal Path Length Binary Search Tree. Commun. ACM 31(5): 579-585 (1988)

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.