Abstract
We consider the problem of identifying a leaf in a finite binary tree T by posing a sequence of questions of the form “Is the leaf in subtree U of T?” for various U. This scheme was considered in [2], but we will discuss the problem again in a much cleaner way and show our result in a form different from [2].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Horibe, Y. “An Entropy View of Fibonacci Trees”. The Fibonacci Quarterly, Vol. 20 (1982): pp. 168–78.
Rivest, R.L.“The Game of “N questions” on a Tree”. Discrete Math., Vol. 17, (1977): pp. 181–6.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Horibe, Y. (1996). On Dichotomous Complexity of the Fibonacci Tree. In: Bergum, G.E., Philippou, A.N., Horadam, A.F. (eds) Applications of Fibonacci Numbers. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-0223-7_20
Download citation
DOI: https://doi.org/10.1007/978-94-009-0223-7_20
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-6583-2
Online ISBN: 978-94-009-0223-7
eBook Packages: Springer Book Archive