Building optimal binary search trees from sorted values in O(N) time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2635, Issue , 2004, Pages 376-388

  Vaucher, Jean G ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Balanced trees; Binary search tree; Data structures

Indexed keywords

DATA STRUCTURES; FORESTRY; TREES (MATHEMATICS);

BALANCED TREES; BINARY REPRESENTATIONS; BINARY SEARCH TREES; CHARACTERISTIC SHAPES; OPTIMAL BINARY SEARCH TREES; PATH LENGTH; SIMPLE ALGORITHM; TREE SIZE;

BINARY TREES;

EID: 35048838530     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39993-3_17     Document Type: Article

References (8)

1. N. Wirth, Algorithms + data structures=programs. Englewood Cliffs, N.J.: Prentice-Hall, 1976.
2. F. M. Carrano and J. J. Prichard, Data abstraction and problem solving with Java: walls and mirrors, 1st ed. Boston: Addison-Wesley, 2001.
3. F. M. Carrano, P. Helman, and R. Veroff, Data structures and problem solving with Turbo Pascal: walls and mirrors. Redwood City, Calif.; Don Mills, Ont.: Benjamin/Cummings Pub. Co., 1993.
4. G. M. Adelson-Velskii and E. M. Landis, An Algorithm for the Organization of Information, Soviet Mathematics (translated from Doklady Akademii Nauk, SSSR), vol. 3, pp. 1259-1263, 1962.
5. M. A. Weiss, Data Structures and Algorithm Analysis in Java: Addison-Wesley, 1999.
6. D. E. Knuth, The art of computer programming: Sorting and searching., vol. 3. Reading, Mass.,: Addison-Wesley Pub. Co., 1973.
7. O.-J. Dahl, B. Myhrhaug, and K. Nygaard, SIMULA-67 Common Base Language, Norwegian Computer Centre, Oslo, Norway, Technical Report 1970.
8. O.-J. Dahl and C. A. R. Hoare, Hierarchical Program Structures, in Structured Programming, vol. 8, A.P.I.C. Studies in Data Processing. London: Academic Press, 1972, pp. 175-220.