On deletion in threaded binary trees

DOI10.1016/0196-6774(86)90030-1MaRDI QIDQ3777467zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Analysis of the standard deletion algorithms in exact fit domain binary search trees
• Computing parent nodes in threaded binary trees
• A trivial algorithm whose analysis is not: a continuation
• Deletion without rebalancing in binary search trees
• Deletion without rebalancing in balanced binary trees

Cited in

(6)

• Computing parent nodes in threaded binary trees
• Emerging behavior as binary search trees are symmetrically updated.
• Deletion: The curse of the red-black tree
• The new design of the threaded binary trees
• Randomness Preserving Deletions on Special Binary Search Trees
• Counting labels in binary trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777467)