𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Another representation of binary tree traversal

✍ Scribed by Edward N. Adams III

Book ID
113161719
Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
464 KB
Volume
2
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Traversing binary trees simply and cheap
Traversing binary trees simply and cheaply
✍ Morris, Joseph M. (author) πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 241 KB

## trees binary trees tree traversal algorithms ' traversals without stacks Knugh [I] describes an algoriti:\_tr for traversing the nodes of a binary tree in preorder, symmetric order OF en&&r without using ~3 autiliq stack. The motivation for doing tlhis lies in the fact that if a stack is used, t