The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Bookmark and Share
gao du jin si zui jia 2-3 shu
Author(s): 
Pages: 653-657
Year: Issue:  9
Journal: Chinese Science Bulletin

Keyword:  近似最佳关键字搜索树外点搜索时间算法文献内点种子结构科学通报;
Abstract: <正> 2-3树是一种很重要的平衡搜索树。文献[1]中叙述了2-3树(也叫3-2树)的定义(在每个内点上存放一个或两个关键字,且分别具有两个或三个儿子点;所有外点在同一层上)。显然,具有N个关键字的2-3树,其高度h在log3(N+1)≤h≤log2(N+1)之间。在这种树上的最坏搜索时间是O(h)。文献[1]中还给出了对它的O(h)时间的插入算法。通过该插入算法插入每个随机关键字而生成的2-3树叫动态自由2-3树。文献[2]研究了N→∞时这
Related Articles
No related articles found