The new design of the threaded binary trees

DOI10.1080/00207169308804229MaRDI QIDQ4297204zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithm complexitynew-type threaded binary treetraversal algorithm

Mathematics Subject Classification ID

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

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

Cited in

(2)

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

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)