On Dichotomous Complexity of the Fibonacci Tree

Yasuichi Horibe

A chapter in Applications of Fibonacci Numbers, 1996, pp 251-256 from Springer

Abstract: 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 (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-009-0223-7_20

Ordering information: This item can be ordered from
http://www.springer.com/9789400902237

DOI: 10.1007/978-94-009-0223-7_20

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().