Login / Signup

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

Richard A. FrostM. M. Peterson
Published in: Softw. Pract. Exp. (1982)
Keyphrases
  • binary search trees
  • data structure
  • ordered sets
  • parallel algorithm
  • search tree
  • database
  • database systems
  • data analysis
  • lower bound
  • cost function
  • orders of magnitude