Extremal cost tree data structures
Given a cost measure for some class of trees, we are interested in characterizing the trees that attain the minimal or maximal cost amongst all trees of the same size. We present our latest results in this area for the classes of AVL trees and brother trees, and for the cost measures based on binary comparisons and node visits. We also briefly consider the space cost measure for brother trees and the unbalance cost measure for AVL trees.
Unable to display preview. Download preview PDF.
- G.H. Gonnet. Balancing binary trees by internal path reduction. Communications of the ACM, 26:1074–1081, 1983.Google Scholar
- R. Klein and D. Wood. The node visit cost of brother trees. Information and Control, 75:107–129, 1987.Google Scholar
- R. Klein and D. Wood. A Tight Upper Bound for the Path Length of AVL Trees. Technical Report, Department of Computer Science, University of Waterloo, 1987.Google Scholar
- D.E. Knuth. The Art of Computer Programming, Vol.3: Sorting and Searching. Addison-Wesley Publishing Co., Reading, Mass., 1973.Google Scholar
- K. Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching. Springer-Verlag, New York, 1984.Google Scholar
- R.E. Miller, N.J. Pippenger, A.L. Rosenberg, and L. Snyder. Optimal 2,3-trees. SIAM Journal on Computing, 8:42–59, 1979.Google Scholar
- Th. Ottmann, D.St. Parker, A.L. Rosenberg, H.-W. Six, and D. Wood. Minimal-cost brother trees. SIAM Journal on Computing, 13:197–217, 1984.Google Scholar
- Th. Ottmann, H.-W. Six, and D. Wood. On the correspondence between AVL trees and brother trees. Computing, 23:43–54, 1979.Google Scholar
- Th. Ottmann and D. Wood. 1–2 brother trees or AVL trees revisited. Computer Journal, 23:248–255, 1981.Google Scholar
- A.L. Rosenberg and L. Snyder. Minimal comparison 2,3-trees. SIAM Journal on Computing, 7:465–480, 1978.Google Scholar
- A.L. Rosenberg and L. Snyder. Time-and space-optimality in B-trees. ACM Transactions on Database Systems, 6:174–183, 1981.Google Scholar