Achieving a uniform interface for binary tree implementations
Abstract
References
Index Terms
- Achieving a uniform interface for binary tree implementations
Recommendations
Achieving a uniform interface for binary tree implementations
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 ...
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. ...
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
Information & Contributors
Information
Published In
- Chairman:
- Cary Laxer,
- Editors:
- Curt M. White,
- James E. Miller,
- Judy Gersting
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Conference
Acceptance Rates
Upcoming Conference
- Sponsor:
- sigcse
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 268Total Downloads
- Downloads (Last 12 months)45
- Downloads (Last 6 weeks)11
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in