On k-dimensional balanced binary trees.

DOI10.1006/JCSS.1996.0025zbMATH Open1152.68431OpenAlexW2086158775MaRDI QIDQ960472FDOQ960472

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)

Cited In (3)

• Title not available (Why is that?)
• Self-Adjusting k-ary Search Trees
• Intervals of balanced binary trees in the Tamari lattice

   Recommendations

• Multidimensional balanced binary trees 👍 👎
• Self-adjusting binary search trees 👍 👎
• Title not available (Why is that?) 👍 👎
• Binary search trees of almost optimal height 👍 👎
• Title not available (Why is that?) 👍 👎

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)