Morris' tree traversal algorithm reconsidered (Q1122985)

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.