On Dichotomous Complexity of the Fibonacci Tree
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 , but we will discuss the problem again in a much cleaner way and show our result in a form different from .
KeywordsRoot Node Induction Hypothesis Binary Tree Internal Node Edge Incident
Unable to display preview. Download preview PDF.