| 树的数据结构的改进研究 |
| |
| 引用本文： | 李咏霞. 树的数据结构的改进研究[J]. 电脑编程技巧与维护, 2009, 0(4): 99-100 |
| |
| 作者姓名： | 李咏霞 |
| |
| 作者单位： | 重庆大学计算机学院,重庆,400030;重庆城市管理职业学院,重庆,400055 |
| |
| 摘 要： | 本文首先简单介绍了树的原理，然后在分析目录树的基础上给出了一种改进后的树存储数据结构，它在维护大量数据的同时，降低了数据冗余度。在建立树的经典数据结构的基础上提出了一种基于哈希算法的树构建数据结构。通过分析它们的时间复杂度，均较改进前有了较大减少。
|
| 关 键 词： | 树 数据结构 存储 构造 压缩存储 哈希 时间复杂度 |
The Improve Research of Tree's Data Structure |
| |
| LI Yongxia. The Improve Research of Tree's Data Structure[J]. Computer Programming Skills & Maintenance, 2009, 0(4): 99-100 |
| |
| Authors: | LI Yongxia |
| |
| Affiliation: | College of Computer Science of ChongQing University;Chongqing 400030;ChongQing City Management College;Chongqing 400055 |
| |
| Abstract: | This paper outlined the theory of tree,then outlined a improved data Structure through analyzed the list tree, which not only maintained great amount of data but also declined the data redundancy.In building data structure of tree,this paper gave a improved structure based on Hash algorithm.And they used fewer time than before through analyzed their time complexity. |
| |
| Keywords: | Tree Data Structure Storage Structure Compressed Storage Hash Time Complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
