Balancing binary trees by internal path reduction

DOI10.1145/358476.358509zbMath0587.68060OpenAlexW2082089278WikidataQ128126892 ScholiaQ128126892MaRDI QIDQ3714475

Gaston H. Gonnet

Publication date: 1983

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/358476.358509

zbMATH Keywords

algorithm for balancing binary search treesnumber of rotations

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (4)

A tight upper bound for the path length of AVL trees ⋮ Height balance distribution of search trees ⋮ UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES ⋮ UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES

This page was built for publication: Balancing binary trees by internal path reduction