Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The new design of the threaded binary trees

From MaRDI portal
Publication:4297204
Jump to:navigation, search

DOI10.1080/00207169308804229zbMATH Open0807.68021OpenAlexW2147474382MaRDI QIDQ4297204FDOQ4297204


Authors: Dake He Edit this on Wikidata


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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4297204&oldid=18230500"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 19:16. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki