Login / Signup

A Note on the Horton-Strahler Number for Random Binary Search Trees.

Paul Kruszewski
Published in: Inf. Process. Lett. (1999)
Keyphrases
  • binary search trees
  • computational complexity
  • small number
  • search algorithm
  • information systems
  • data analysis
  • branch and bound
  • maximum number