Eliminating the flag in threaded binary search trees

DOI10.1016/0020-0190(86)90137-7zbMath0627.68053OpenAlexW2000066175MaRDI QIDQ1092666

Dan Gordon

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90137-7

zbMATH Keywords

shared memorybinary search treethreaded binary treemultiprocessor environment

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items

The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing

Cites Work

• Traversing binary trees simply and cheaply
• Symbol manipulation by threaded lists
• Unnamed Item
• Unnamed Item