An improved algorithm for traversing binary trees without auxiliary stack
References (3)
Fast and Read-only Algorithms for Traversing Trees without an Auxiliary Stack
Information Processing Letters
(1972)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 1973 Published by Elsevier B.V.