Brian Allen
- 1 BAER, J L Weight balanced trees Proc AFIPS 1975 NCC, AFIPS Press, Montvale, N J, 1975, pp 467-472Google Scholar
- 2 BAYER, P J Improved bounds on the costs of optimal and balanced binary search trees Tech, Memo. 69, Proj MAC, M l T., Cambridge, Mass., 1975Google Scholar
- 3 BITNER, J.R Heuristics that dynamically alter data structures to decrease their access time Rep UlUCDCS- R-76-818, Dept of Comptr Scl., U. of llhnols at Urbana-Champalgn, Orbana, ill., July 1976Google Scholar
- 4 KEMENY, J G., AND SNELL, J L Finite Markov Chains. Van Nostrand, Princeton, N j, 1960Google Scholar
- 5 KNOTH, D E The Art of Computer Programmmg, Vol. 1" FundamentalAlgor~thms Addison-Wesley, Reading, Mass, 1969 Google Scholar
- 6 KNUTH, D E The Art of Computer Programmmg, Vol 3 Sortmg and Searching. Addison-Wesley, Reading, Mass, 1973 Google Scholar
- 7 MEHLHORN, K Nearly opUmal binary search trees Acta lnformattca 5 (1975), 287-295Google Scholar
- 8 MEHLHORN, K Private correspondenceGoogle Scholar
- 9 RIVEST, R On self-orgamzmg sequential search heunsttcs Comm ACM 19, 2 (Feb 1976), 63-67 Google Scholar
Index Terms
- Self-Organizing Binary Search Trees
Recommendations
Self-adjusting binary search trees
The splay tree, a self-adjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an n-node splay tree, all ...
Path Length of Binary Search Trees
An algorithm is given for constructing a binary tree of minimum weighted path length and with restricted maximum path length. (Huffman’s tree is a binary tree of minimum weighted path length with no restriction on maximum path length.) When an ...
Comments