基于费氏树的费氏查找思想的探索与实现  

Exploring and Realizing Fee-search Based on Fee-tree

作　　者：李静[1] 王效政[2] 

机构地区：[1]河北北方学院医学信息系,河北张家口075000 [2]张家口教育学院,河北张家口075000

出　　处：《河北北方学院学报（自然科学版）》2009年第4期48-52,共5页Journal of Hebei North University:Natural Science Edition

摘　　要：目的完善与合理地实现基于费氏树这种典型数据结构的费氏查找全过程.方法通过理论研究与实践,针对相关费氏查找及实现过程方面论述的欠缺,对费氏树的结构特性探索出更加合理、完善的定义,丰富和明确了这种二元树结构的特定含义;探索出费氏树节点的确立方法和实现费氏树构建的方式;对费氏树与待查找序列的关联性做出探讨.结果完善和明确了费氏查找的设计思想,并对其具体实现过程探索出更加合理的实现方式.结论费氏查找全面体现了基于特定数据结构的存储实现来实施数据管理这一原则.对于丰富《数据结构》学科中典型数据结构及数据查询方面内容具有一定的理论价值.Objective To improve the achievement of a reasonable Fee-search based on a typical data structure, the Fee-tree, and to find the whole process of this investigation. Methods Exploring more rea- sonable and improved definition of Fee-tree structure characteristics, and defining the specific meaning of binary tree structure through theoretical research and practice; exploring the establishment of tree node＇s methods and the realization to build the tree＇s way; exploring the relevance between the Fee-tree and the search array. Results The studies improve and define the design ideas for fee-search, and explore the concrete realization of the process to achieve a more rational way. Conclusion Fee-search wholly embodies a principle of realizing a way to implement the data management based on the storage of the specific data structure. Certain aspect of the theoretical value can be proved in the typical data structure and data inquiries of Data Structure.

关 键 词：费氏查找 费氏树 节点探索 待查找序列 特定元 时间复杂度 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]