Exploring and Realizing Fee-search Based on Fee-tree
Xiaozheng Wang · Journal of Hebei North University · 2009
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 reasonable 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.