
- fr1. Communications of the ACM, Vol. 11, No. 9, pp. 172-173.Google Scholar
- fr2. Knuth, D. E., The Art of Computer Programming (Reading, Mass.: Addison-Wesley, 1969),pp. 315-328.Google Scholar
- fr3. Tremblay, J. P. and P. G. Sorenson, An Introduction to Data Structures with Applications, New York: McGraw-Hill, 1976), pp. 320-326. Google Scholar
Digital Library
- fr4. Knuth, p. 316.Google Scholar
- fr5. Lewis, T. G., and M. Z. Smith, Applying Data Structures, (Atlanta: Houghton-Mifflin, 1976), pp.71-74. Google Scholar
Digital Library
- fr6. Page, E. S. and L. B. Wilson, Information Representation and Manipulation in a Computer, (Cambridge: Cambridge University Press, 1975), p. 113. Google Scholar
Digital Library
Recommendations
Tree evolution processes for bucket increasing trees
AbstractBucket increasing trees are multilabelled generalizations of increasing trees, where each non-leaf node carries b labels, with b ≥ 1 a fixed integer. We provide a fundamental result, giving a complete characterization of all families ...
Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
This article proposes an approximation of the tree edit distance through the string edit distance for binary tree codes, instead of for Euler strings introduced by Akutsu (2006). Here, a binary tree code is a string obtained by traversing a binary tree ...
Traversing binary tree structures with shift register memories (Recent Results)
The paper proposes a tree-structured shift register memory in which traversals of binary data tress in pre-or end-order are performed as sequences of two non-cyclic data permutations which move the data tree relative to a unique access port that is ...






Comments