A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees

DOI10.1109/TC.1985.5009411zbMath0566.68058OpenAlexW2061386815MaRDI QIDQ3681949

Abha Moitra, S. Sitharama Iyengar

Publication date: 1985

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1985.5009411

zbMATH Keywords

parallel algorithmbinary search treesiterative balancing algorithm

Mathematics Subject Classification ID

Trees (05C05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Cost-optimal parallel algorithms for constructing B-trees ⋮ On constructing multiple spanning trees in a hypercube ⋮ Optimal binary search trees ⋮ Parallel algorithms for red--black trees ⋮ Optimal parallel quicksort on EREW PRAM

This page was built for publication: A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees