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. © 2003 Elsevier B.V. All rights reserved.
Recker, F. (2004). Searching in trees. Discrete Applied Mathematics, 140(1–3), 169–183. https://doi.org/10.1016/j.dam.2003.05.001