Almost Optimal Dynamic 2–3 trees
- 16 Downloads
This paper presents a principle to create Almost Optimal Dynamical 2–3 trees based on the theory of Milleret 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 asN→∞, and evaluate its approximate height,h=log2.45(N+1), whereN is the number of nodes of a 2–3 tree. Finally, this paper analyses the time complexities of the algorithms, which areO(log2.45(N+1)).
KeywordsLeaf Node Insertion Algorithm Father Node Approximate Height Deletion Algorithm
Unable to display preview. Download preview PDF.