Balance in AVL trees and space cost of brother trees
type: Item
instance of: scholarly article
title: Balance in AVL trees and space cost of brother trees
zbMATH Open document ID: 0824.68028
DOI: 10.1016/0304-3975(94)90040-X
author: Helen Cameron
author: D. Wood
published in: Theoretical Computer Science
publication date: 1995-01-11T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 710227
zbMATH Keywords: AVL trees
MaRDI profile type: Publication
cites work: Expected behaviour analysis of AVL trees
cites work: A Partial Analysis of Random Height-Balanced Trees
cites work: The node visit cost of brother trees
cites work: On the path length of binary trees
cites work: A tight upper bound for the path length of AVL trees
cites work: Q4057549
cites work: Q5815665
cites work: A Partial Analysis of Height-Balanced Trees under Random Insertions and Deletions
cites work: Minimal-Cost Brother Trees
cites work: Q4096430
cites work: 1-2 Brother Trees or AVL Trees Revisited
cites work: On random 2-3 trees
full work available at URL: 0304-3975(94)90040-x
OpenAlex ID: W2021595526
description: scientific article; zbMATH DE number 710227