𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Traversing binary trees simply and cheaply

✍ Scribed by Morris, Joseph M. (author)


Book ID
111935353
Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
241 KB
Volume
9
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

✦ Synopsis


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, the


πŸ“œ SIMILAR VOLUMES