On k-dimensional balanced binary trees.

DOI10.1006/JCSS.1996.0025MaRDI QIDQ960472zbMATH OpenOpenAlexFDO

Authors Vijay K. Vaishnavi

Publication date 21 December 2008

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcss.1996.0025

zbMATH Keywords

self-organizing balanced binary tree

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Multidimensional balanced binary trees
• Self-adjusting binary search trees
• Deletion without rebalancing in balanced binary trees
• Binary search trees of almost optimal height
• scientific article; zbMATH DE number 140483

Cited in

(5)

• Self-Adjusting k-ary Search Trees
• The Analysis of an Improved Symmetric Binary B-tree Algorithm
• scientific article; zbMATH DE number 3881889 (Why is no real title available?)
• Multidimensional balanced binary trees
• Intervals of balanced binary trees in the Tamari lattice

This page was built for publication: On \(k\)-dimensional balanced binary trees.

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