M. Morris, Traversing Binary Trees Simply and Cheaply, In- formation Processing Letters, 9, 5, (1979), 197-200.J.M. Morris, Traversing binary trees simply and cheaply, Injio. Process. Lett. 9 (5) (1979) 197-200.J. M. Morris, Traversing binary trees simply and cheaply, Information ...
1974, Information Processing Letters Scanning list structures without stacks or tag bits 1973, Information Processing Letters An improved algorithm for traversing binary trees without auxiliary stack 1973, Information Processing Letters Loop-free algorithms for traversing binary trees 1984, BITView...
Applications of a doubly linked list - A great way to represent a deck of cards in a game. - Applications that have a Most Recently Used (MRU) list (a linked list of file names) - A stack, hash table, and binary tree can be implemented using a doubly linked list. - Undo functional...
We survey and classify the various algorithms for traversing binary trees in the three principal orders and the related two- and three-visit traversal orders. For each class of algorithms we determine which of the traversal orders may be effected by means of loop-free traversal algorithms. ...
An improved algorithm for traversing binary trees without auxiliary stack - Robson - 1973 () Citation Context ...d is due to Perlis and Thorton [6]. Their method, however, requires an extra bit for each pointer, making it an O�(n)-space algorithm. An improvement on the basic ...