The new design of the threaded binary trees

DOI10.1080/00207169308804229zbMATH Open0807.68021OpenAlexW2147474382MaRDI QIDQ4297204FDOQ4297204

Authors: Dake He 

Publication date: 3 July 1994

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169308804229

Recommendations

• A study of binary tree traversal algorithms and a tag-free threaded representation
• Computing parent nodes in threaded binary trees
• On deletion in threaded binary trees
• Constructing a binary tree efficiently from its traversals
• The Expected Performance of Traversal Algorithms in Binary Trees

zbMATH Keywords

algorithm complexitytraversal algorithmnew-type threaded binary tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (2)

• A study of binary tree traversal algorithms and a tag-free threaded representation
• Computing parent nodes in threaded binary trees

This page was built for publication: The new design of the threaded binary trees

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