On deletion in threaded binary trees

DOI10.1016/0196-6774(86)90030-1zbMath0637.68069OpenAlexW2053949821MaRDI QIDQ3777467

Keith Brinck

Publication date: 1986

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(86)90030-1

zbMATH Keywords

binary search treesdeletion algorithmsthreaded binary trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Computing parent nodes in threaded binary trees ⋮ Emerging behavior as binary search trees are symmetrically updated. ⋮ Counting labels in binary trees

This page was built for publication: On deletion in threaded binary trees