Morris' tree traversal algorithm reconsidered (Q1122985)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Morris' tree traversal algorithm reconsidered |
scientific article; zbMATH DE number 4108169
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Morris' tree traversal algorithm reconsidered |
scientific article; zbMATH DE number 4108169 |
Statements
Morris' tree traversal algorithm reconsidered (English)
0 references
1988
0 references
Algorithms of D. E. Knuth [\textit{D. E. Knuth}, The art of computer programming, Vol. 1: Fundamental Algorithms (Addison Wesley, (1968; Zbl 0191.179)] and of J. M. Morris [\textit{J. M. Morris}, Traversing binary trees simply and cheaply, Inf. Process. Lett. 9, 197-200 (1979; Zbl 0422.68028)] for traversing binary trees are reproduced and discussed. As result it is shown that the Morris algorithm uses a stack what is not seen at the first glance. In this formal proof, control structure transformations are used.
0 references
tree traversal
0 references
Morris' algorithm
0 references
stack-free algorithm
0 references
binary trees
0 references
0.785403847694397
0 references
0.7624284625053406
0 references
0.7547598481178284
0 references
0.7358238101005554
0 references
