Optimal binary search trees

References

• Knuth , D. E. 1971 . Optimal binary search trees . Acta Informatica , 1 : 14 – 25 .
   Google Scholar
• Knuth , D. E. 1973 . The Art of Computer Programming , Vol. 3 , Addison-Wesley .
   Google Scholar
• Yao , F. F. 1980 . Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing . Efficient dynamic programming using quadrangle inequalities . 1980 , Los Angeles.
   Google Scholar
• Ottmann , T. , Rosenberg , A. L. , Six , H. -W. and Wood , D. 1984 . Binary search trees with binary comparison cost . International Journal of Computer and Information Sciences , 13 77 – 101 .
   Google Scholar
• Sheil , B. A. 1978 . Median split trees: A fast lookup technique for frequently occurring keys . Comm. ACM , 21 ( 11 ) Nov : 949 – 958 .
   Google Scholar
• Huang , S. -H. S. and Wong , C K. 1984 . Optimal binary split trees . Journal of Algorithms , 5 ( 11 ) Nov : 69 – 79 .
   Google Scholar
• Huang , S. -H. S. and Wong , C. K. 1984 . Generalized binary split trees . Acta Informatica , 21 ( 11 ) Nov : 113 – 123 .
   Google Scholar
• Choy , D. M. and Wong , C. K. 1977 . Bounds for optimal α—β binary trees . BIT , 17 ( 11 ) Nov : 1 – 15 .
   Google Scholar