A Function for Generating Nearly Balanced Binary Search Trees from Sets or Non-random Keys

Richard A. Frost, M. M. Peterson. A Function for Generating Nearly Balanced Binary Search Trees from Sets or Non-random Keys. Software: Practice and Experience, 12(2):163-168, 1982.

@article{FrostP82,
  title = {A Function for Generating Nearly Balanced Binary Search Trees from Sets or Non-random Keys},
  author = {Richard A. Frost and M. M. Peterson},
  year = {1982},
  tags = {search},
  researchr = {https://researchr.org/publication/FrostP82},
  cites = {0},
  citedby = {0},
  journal = {Software: Practice and Experience},
  volume = {12},
  number = {2},
  pages = {163-168},
}