Searching in trees

  • Authors:

  • Frank Recker

  • Affiliations:

  • Department of Mathematics, University of Hagen, D-58084 Hagen, Germany

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2004

Quantified Score

Hi-index 0.04

Visualization

Abstract

In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given.