Almost Optimal Dynamic 2-3 Trees

This paper presents a principle to create Almost Optimal Dynamical 2-3 trees based on the theory of Miller et al.,and gives a searching algorithm,an insertion algorithm and a deletion algorithm for these 2-3 trees.Experimental result given in this paper indicates that these 2-3 trees have very good performance at node-visit cost.We discuss asymptotic 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 analyse...