|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Traversing Binary Tree Structures with Shift-Register Memories
November 1977 (vol. 26 no. 11)
pp. 1112-1122
| ASCII Text | x | ||
| W.E. Kluge, "Traversing Binary Tree Structures with Shift-Register Memories," IEEE Transactions on Computers, vol. 26, no. 11, pp. 1112-1122, November, 1977. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1977.1674757, author = {W.E. Kluge}, title = {Traversing Binary Tree Structures with Shift-Register Memories}, journal ={IEEE Transactions on Computers}, volume = {26}, number = {11}, issn = {0018-9340}, year = {1977}, pages = {1112-1122}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1977.1674757}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Traversing Binary Tree Structures with Shift-Register Memories IS - 11 SN - 0018-9340 SP1112 EP1122 EPD - 1112-1122 A1 - W.E. Kluge, PY - 1977 KW - Data permutations KW - shift-register memories KW - traversal control KW - tree structures KW - tree traversals. VL - 26 JA - IEEE Transactions on Computers ER - | |||
The paper proposes a tree-structured shift-register memory which employs two different data permutation operations to perform pre-/post-order traversals of binary tree structures.
Index Terms:
Data permutations, shift-register memories, traversal control, tree structures, tree traversals.
Citation:
W.E. Kluge, "Traversing Binary Tree Structures with Shift-Register Memories," IEEE Transactions on Computers, vol. 26, no. 11, pp. 1112-1122, Nov. 1977, doi:10.1109/TC.1977.1674757
Usage of this product signifies your acceptance of the Terms of Use.