Fibonacci numbers have become a popular introduction to recursion for Computer Science students and there's a strong argument that they persist within nature.Fibonacci数字已经成为计算机科学学生递归的一个流行的介绍，并且有一个强烈的论据，他们坚持在自然界。For these reasons, many of us are familiar with them.出于这些原因，我们很多人都熟悉它们。
They also exist within Computer Science elsewhere too;它们也存在于其他地方的计算机科学中;in surprisingly efficient data structures and algorithms based upon the sequence.在基于序列的令人惊讶的有效数据结构和算法中。
There are two main examples that come to mind:我想到了两个主要的例子：
Fibonacci heaps which have better amortized running time than binomial heaps.斐波那契堆比二项式堆具有更好的摊销运行时间。
Fibonacci search which shares O(log N) running time with binary search on an ordered array.Fibonacci搜索在有序数组上与二进制搜索共享O（log N）运行时间。
Is there some special property of these numbers that gives them an advantage over other numerical sequences?这些数字是否有某些特殊属性可以使它们优于其他数字序列？Is it a spatial quality?这是空间质量吗？What other possible applications could they have?他们还有哪些其他可能的应用程序？
It seems strange to me as there are many natural number sequences that occur in other recursive problems, but I've never seen a Catalan heap.这对我来说似乎很奇怪，因为在其他递归问题中有许多自然数字序列，但我从未见过加泰罗尼亚语堆。
