%0 Journal Article
%T Almost Optimal Dynamic 2-3 Trees
%A Li
%A Wanxue
%J 计算机科学技术学报
%D 1986
%I 
%X This paper presents a principle to create Almost Optimal Dynamical 2-3 trees basedon the theory of Miller et al.,and gives a searching algorithm,an insertion algorithmand a deletion algorithm for these 2-3 trees.Experimental result given in this paperindicates that these 2-3 trees have very good performance at node-visit cost.We discussasymptotic property of the 2-3 trees as N→∞,and evaluate its approximate height,h=log_(2.45)(N+1),where N is the number of nodes of a 2-3 tree.Finally,this paper analysesthe time complexities of the algorithms,which are O(log_(2.45)(N+1)).
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=5F306FF9D7FBADA4109AC7E9AB6A94D5&yid=4E65715CCF57055A&vid=CA4FD0336C81A37A&iid=0B39A22176CE99FB&sid=BFE7933E5EEA150D&eid=4F2F18DD6F870C2C&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=0