Distribution driven binary tree balancing with R-trees

  • Authors:

  • Richard K. Brewer

  • Affiliations:

  • Computer Science Program, Sangamon State University, Springfield, IL

  • Venue:
  • CSC '93 Proceedings of the 1993 ACM conference on Computer science
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

A binary tree built by comparisons to theoretical rather than actual values can be balanced while it is being built, resulting in a BST the balance of which depends upon the distribution of the values rather than the order.