Issue No.09 - September (1986 vol.35)
V.K. Vaishnavi , Department of Computer Information Systems, Georgia State University
It is shown that the worst case height of a k- dimensional height-balanced tree, k = 2, is the same as that of an AVL-tree, to within an additive factor of 2k - 2.
multidimensional height- balanced trees, Data structure analysis, dynamic databases, height-balanced trees, information storage and retrieval, multidimensional balanced tree structures
V.K. Vaishnavi, "On the Height of Multidimensional Height-Balanced Trees", IEEE Transactions on Computers, vol.35, no. 9, pp. 773-780, September 1986, doi:10.1109/TC.1986.1676837