On Dichotomous Complexity of the Fibonacci Tree

  • Yasuichi Horibe

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].

Keywords

Root Node Induction Hypothesis Binary Tree Internal Node Edge Incident 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Horibe, Y. “An Entropy View of Fibonacci Trees”. The Fibonacci Quarterly, Vol. 20 (1982): pp. 168–78.MATHGoogle Scholar
  2. [2]
    Rivest, R.L.“The Game of “N questions” on a Tree”. Discrete Math., Vol. 17, (1977): pp. 181–6.MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Yasuichi Horibe

There are no affiliations available

Personalised recommendations