Abstract
One of the basic principles taught in a data structures course is that an application program should be independent of the implementation of any particular data structure it uses. This policy breaks down when binary trees are introduced, because the interfaces for the various representations of binary trees are not uniform. In particular, implementing a binary tree by using an implicit array generally requires the array itself to be passed as a parameter to any function that manipulates the tree. In this paper we present an approach for defining the implicit array representation of a binary tree. Our definition makes the underlying array transparent to the user. This allows us to describe a uniform interface for a binary tree module that can be used by an application program regardless of the particular implementation of the tree.
- 1 Horowitz, E., Sahni, S. and Anderson-Freed, S., Fundamentals of Data Structures in C, Computer Science Press, New York, 1993. Google Scholar
Digital Library
- 2 Kingston. J.H. Algorithms and Data Structures: Design, Correctness, Analysis, Addison-Wesley, Reading~ Mass., 1990. Google Scholar
Digital Library
- 3 Tenenbaum, A.M., Langsmn, Y. and Augenstein, M.J., Data Structures Using C, Prentice Hail, Englewood Cliffs, N.J., 1990. Google Scholar
Digital Library
- 4 Weiss, M.A., Data Structures and Algorithm Analysis in C, Benjamin Cummings, Menlo Park, Ca., 1993. Google Scholar
Digital Library
Index Terms
Achieving a uniform interface for binary tree implementations
Recommendations
Achieving a uniform interface for binary tree implementations
SIGCSE '95: Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science educationOne of the basic principles taught in a data structures course is that an application program should be independent of the implementation of any particular data structure it uses. This policy breaks down when binary trees are introduced, because the ...
The suffix binary search tree and suffix AVL tree
Suffix trees and suffix arrays are classical data structures that are used to represent the set of suffixes of a given string, and thereby facilitate the efficient solution of various string processing problems--in particular on-line string searching. ...
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 ...







Comments