On the Height of Multidimensional Height-Balanced Trees

DOI10.1109/TC.1986.1676837MaRDI QIDQ3742731zbMATH OpenOpenAlexFDO

Authors Vijay K. Vaishnavi

Publication date 1986

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1986.1676837

zbMATH Keywords

AVL-treedata structure analysisheight-balanced treemultidimensional balanced tree structures

Mathematics Subject Classification ID

Trees (05C05) Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Height-analysis of k-dimensional leaf and node height-balanced trees: A new approach
• Multidimensional balanced binary trees
• Binary search trees of almost optimal height
• scientific article; zbMATH DE number 3845065
• Binary search trees: How low can you go?

Cited in

(2)

• ON THE AVERAGE ALTITUDE OF HEAP-ORDERED TREES
• Height-analysis of k-dimensional leaf and node height-balanced trees: A new approach

This page was built for publication: On the Height of Multidimensional Height-Balanced Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3742731)