| 2—3查找树：概念,算法和分析 |
| |
| 引用本文： | 郭福顺,廖明宏.2—3查找树：概念,算法和分析[J].哈尔滨工业大学学报,1994,26(4):28-31. |
| |
| 作者姓名： | 郭福顺 廖明宏 |
| |
| 作者单位： | 哈尔滨工业大学计算机科学与工程系 |
| |
| 摘 要： | 从抽象数据类型观点提出２－３查找的概念，给出一系列与集合运算有关的算法，包括求并集，交集，差集，测集合包含关系等，并分析算法的时间复杂性，结果表明，它比二元查找树更为有效。
|
| 关 键 词： | 二元查找树 2－3查找树 算法 |
2-3 Searching Trees: Concept, Algorithms and Analyses |
| |
| Guo Fushun ,Liao Minghong, Li Lianzhi, Liu Guiying.2-3 Searching Trees: Concept, Algorithms and Analyses[J].Journal of Harbin Institute of Technology,1994,26(4):28-31. |
| |
| Authors: | Guo Fushun Liao Minghong Li Lianzhi Liu Guiying |
| |
| Affiliation: | Dept. of Computer Science and Engineering |
| |
| Abstract: | Binary search trees and 2-3 trees are widely used in solving scientificproblems: But they have some weaknsses, and is not good enough to support most of the set operations. This paper presents the concept of 2-3 searching trees from the viewpoint of abstraCt data types, gives a series of algorithms related to the set operations, which include union, intersection, deduction, and testing of indusion relations between two set etc, and analyzes the computing time complexity of the algorithms. The results show that it is more effective than the binary search tree. |
| |
| Keywords: | Binary searching trees 2-3 searching trees abstract data types |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
