Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Generalized non-recursive traversal of binary trees

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

DOI10.1002/SPE.4380111207zbMath0466.68054OpenAlexW2012461315MaRDI QIDQ3919096

A. C. Kilgour

Publication date: 1981

Published in: Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/spe.4380111207


zbMATH Keywords

tree traversalnon-recursive algorithmrecursion elimination


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)


Related Items (2)

Optimal binary search trees ⋮ Loop-free algorithms for traversing binary trees







This page was built for publication: Generalized non-recursive traversal of binary trees

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3919096&oldid=17585597"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 21:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki