General Balanced Trees

DOI10.1006/JAGM.1998.0967zbMATH Open0918.68077OpenAlexW2054956600MaRDI QIDQ4228282FDOQ4228282

Authors:

Publication date: 17 August 1999

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/724e9f0451dac7d0423be8b43b69fe3c807083b3

Recommendations

• Maintaining α-balanced trees by partial rebuilding
• scientific article; zbMATH DE number 140484
• DYNAMIC TREE REBALANCING USING RECURRENT ROTATIONS: DYNAMIC TREE REBALANCING
• scientific article; zbMATH DE number 1951565

zbMATH Keywords

general balanced trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (13)

• On embedding subclasses of height-balanced trees in hypercubes
• Embedding height balanced trees and Fibonacci trees in hypercubes
• Title not available (Why is that?)
• STRONGER QUICKHEAPS
• An efficient algorithm for estimating rotation distance between two binary trees
• A direct algorithm for restricted rotation distance
• Rank-Balanced Trees
• Effective splaying with restricted rotations
• Balanced ordered trees
• Verified Root-Balanced Trees
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
• PerformERL: a performance testing framework for Erlang
• An improved kernel size for rotation distance in binary trees

This page was built for publication: General Balanced Trees

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