A simple and powerful representation of binary search trees
Part of the Lecture Notes in Computer Science book series (LNCS, volume 507)
Track 4: Algorithms
KeywordsChild Node Parent Node Tree Node Binary Search Tree Additional Space
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- [AHU]Aho, A.V., J.E. Hopcroft and J.D. Ullman, "Data Structures and Algorithms", Addison-Wesley, 1983.Google Scholar
- [B]Bentley, J.I, Multidimensional Binary Search Trees Used for Associative Searching, CACM, 18, 9, 1975.Google Scholar
- [Br]Brinck, K., The Expected Performance of Traversal Algorithms in Binary trees, Comput. J., 28, 4, 1985.Google Scholar
- [BK]Brinck, K. and N.Y. Koo, Analysis of Algorithms on Threaded Trees, Comput. J., 24, 2, 1981.Google Scholar
- [CHZ]Cheng, Y., E. Haq and S.-Q. Zheng, "Threaded Binary Search Trees Without Tags", Proc. of International Conference on Computing and Information, Toronto, 1989.Google Scholar
- [K1]Knuth, D.E., The Art of Computer programming, Vol. 1, Addison-Wesley, Reading, Mass., 1973.Google Scholar
- [K2]Knuth, D.E., The Art of Computer programming, Vol. 3, Addison-Wesley, Reading, Mass., 1973.Google Scholar
- [PS]Preparata, F.P. and M.I. Shamos, Computational Geometry, Springer-Verlag, 1985.Google Scholar
© Springer-Verlag Berlin Heidelberg 1991