"A Function for Generating Nearly Balanced Binary Search Trees from Sets or ..."

Richard A. Frost, M. M. Peterson (1982)

> Home

Details and statistics

DOI: 10.1002/SPE.4380120206

access: closed

type: Journal Article

metadata version: 2020-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/spe/FrostP82
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/spe/FrostP82
Richard A. Frost, M. M. Peterson:
A Function for Generating Nearly Balanced Binary Search Trees from Sets or Non-random Keys. Softw. Pract. Exp. 12(2): 163-168 (1982)

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.