A tight upper bound for the path length of AVL trees
type: Item
instance of: scholarly article
title: A tight upper bound for the path length of AVL trees
zbMATH Open document ID: 0698.68019
DOI: 10.1016/0304-3975(90)90037-I
author: Rolf Klein
author: D. Wood
published in: Theoretical Computer Science
publication date: 1990-01-01T00:00:00Z
review text: See the review in Zbl 0645.68076.
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 4145307
zbMATH Keywords: node visit cost
zbMATH Keywords: binary tree
zbMATH Keywords: Adel'son-Vel'skij-Landis tree
zbMATH Keywords: path length
zbMATH Keywords: AVL trees
zbMATH Keywords: comparison cost
zbMATH Keywords: brother trees
MaRDI profile type: Publication
cites work: Balancing binary trees by internal path reduction
cites work: The node visit cost of brother trees
cites work: On the path length of binary trees
cites work: Q5585020
cites work: Minimal-Cost Brother Trees
cites work: Q4096430
cites work: On the correspondence between AVL trees and brother trees
cites work: 1-2 Brother Trees or AVL Trees Revisited
description: scientific article; zbMATH DE number 4145307