Abstract
The relationship between linear lists and free trees is studied. We examine a number of well-known data structures for computing functions on linear lists and show that they can be canonically transformed into data structures for computing the same functions defined over free trees. This is used to establish new upper bounds on the complexity of several query-answering problems.
Similar content being viewed by others
References
A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
J. L. Bentley, Multidimensional divide and conquer,Comm. ACM,23 (1980), 214–229.
B. Chazelle, A functional approach to data structures and its use in multidimensional searching,SIAM J. Comput. (in press). Preliminary version inProceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, pp. 165–174.
B. Chazelle and L. J. Guibas, Fractional cascading: I. A data structuring technique,Algorithmica,1 (1986), 133–162.
H. Edelsbrunner, A new approach to rectangle intersections, Part II,Internat. J. Comput. Math.,13 (1983) 221–229.
H. N. Gabow, J. L. Bentley, and R. E. Tarjan, Scaling and related techniques for geometry problems,Proceedings of the 16th Annual ACM Symposium on Theory of Computing, 1984, pp. 135–143.
D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestors,SIAM J. Comput.,13 (1984), 338–355.
D. E. Knuth,The Art of Computer Programming, Vol. I, 2nd edn., Addison-Wesley, Reading, MA, 1973
J. Komlós, Linear verification for spanning trees,Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, 1984, pp. 201–206.
E. M. McCreight, Efficient algorithms for enumerating intersecting intervals and rectangles, Technical Report CSL-80-9, Xerox Pare, 1980.
E. M. McCreight, Priority search trees,SIAM J. Comput.,14 (1985), 256–276.
D. D. Sleator and R. E. Tarjan, A data structure for dynamic trees,J. Comput. System Sci.,26 (1983), 362–391.
D. D. Sleator and R. E. Tarjan, Self-adjusting binary search trees,J. Assoc. Comput. Mach.,32 (1985), 652–686.
R. E. Tarjan, Efficiency of a good but not linear set union algorithm,J. Assoc. Comput. Mach.,22 (1975), 215–225.
R. E. Tarjan, Applications of path compression on balanced trees,J. Assoc. Comput. Mach.,26 (1979), 690–715.
J. Vuillemin, A unifying look at data structuŕes,Comm. ACM,23 (1980), 229–239.
D. E. Willard, New data structures for orthogonal range queries,SIAM J. Comput.,14 (1985), 232–253.
A. C. Yao, Space-time tradeoff for answering range queries,Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982, pp. 128–136.
Author information
Authors and Affiliations
Additional information
Communicated by D. T. Lee.
This work was started when the author was at Brown University, Providence, RI. It was partly supported by NSF Grant MCS 83-03925. A preliminary version of this work has appeared in theProceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, West Palm Beach, FL, October 1984, pp. 358–368.
Rights and permissions
About this article
Cite this article
Chazelle, B. Computing on a free tree via complexity-preserving mappings. Algorithmica 2, 337–361 (1987). https://doi.org/10.1007/BF01840366
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01840366