2—3查找树：概念、算法和分析

2-3 Searching Trees: Concept, Algorithms and Analyses

从抽象数据类型的观点提出２—３查找树的概念，给出一系列与集合运算有关的算法，包括求并集、交集、差集，测集合包含关系等，并分析算法的时间复杂性。结果表明，它比二元查找树更为有效。

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.