One-sided k-height-balanced trees
type: Item
instance of: scholarly article
title: One-sided k-height-balanced trees
zbMATH Open document ID: 0394.68047
DOI: 10.1007/BF02265310
published in: Computing
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68R99
zbMATH DE Number: 3612454
zbMATH Keywords: One-Sided Height-Balanced Trees
zbMATH Keywords: Deletion Algorithms
author: Thomas Ottmann
author: Hans-Werner Six
author: D. Wood
MaRDI profile type: Publication
cites work: A generalization of AVL trees
cites work: An insertion technique for one-sided height-balanced trees
cites work: Q4057549
cites work: Insertions and deletions in one-sided height-balanced trees
cites work: On the Height of Height-Balanced Trees
cites work: Rebalancing Height Balanced Trees
cites work: Deletion in one-sided height balanced search trees
cites work: Right brother trees
cites work: An optimal method for deletion in one-sided height-balanced trees
full work available at URL: https://doi.org/10.1007/bf02265310
OpenAlex ID: W164172514
description: scientific article; zbMATH DE number 3612454