期刊文献+

一种基于红黑树的快速查找列表结构

A List Structure Capable of Fast Searching Based on Red-Black Tree
下载PDF
导出
摘要 设计并实现了一种基于红黑树的列表结构.列表中数据存储在红黑树节点中,红黑树的高效查找性能使列表的查找时间复杂度为O(logn).实验表明,其查找效率比遍历查找快2个数量级以上,与二分查找相当.该列表结构适合于各种频繁添加、删除、查找的应用. A list structure is designed and implemented based on Red - Black Tree. The list data are stored in nodes of Red - Black Tree. The high performance of effectively searching Red-Black Tree makes the time complexity of searching the list structure become O (logn). The experiment shows that the efficiency of searching the list structure is above 2 numerical grades faster than that of searching by going all over lists, and as fast as that of binary searching. The list structure is fit for all sorts of applications of frequently adding, removing and searching data.
作者 罗东俊
出处 《云南民族大学学报(自然科学版)》 CAS 2008年第3期250-254,共5页 Journal of Yunnan Minzu University:Natural Sciences Edition
基金 广东省自然科学基金资助项目(06023960)
关键词 列表 红黑树 查找 list Red-Black tree searching
  • 相关文献

参考文献3

  • 1CORMEN T H, LEISERSON C E, RIVEST R L, et al. Introduction to Algorithms[ M]. 2nd ed. Cambridge,MA: MIT Press, 2001.
  • 2MANNA I, SIPMA H B, ZHANG Ting. Verifying Balanced Trees[ C]. Lecture Notes in Computer Science 4514,2007:363 - 378.
  • 3唐自立.一种新的删除红黑树的结点的算法[J].计算机应用与软件,2006,23(1):139-141. 被引量:6

二级参考文献3

  • 1唐自立.一种新的删除AVL树的结点的算法[J].计算机应用与软件,2005,22(4):107-109. 被引量:4
  • 2Cormen T. H. Leiserson C. E. Rivest R L, Stein C, Introduction to Algorithms[ M ] ,2nd ed, Cambridge, MA : MIT Press ,2001.
  • 3Weiss M. A, Data Structures and Algorithm Analysis in C ++ [ M] ,2nd ed, Reading, MA : Addlson-Wesley Longman, 1999.

共引文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部