A fresh look at binary search trees

Journal of Functional Programming

Volumn 12, Issue 6, 2002, Pages 601-607

  Hinze, Ralf ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEARCH TREES;

FUNCTIONAL PROGRAMMING;

BINARY TREES;

EID: 0036848125     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796801004269     Document Type: Article

References (4)

1. Andersson, A. (1991) A note on searching in a binary search tree. Software - Practice and Experience, 21(10), 1125-1128.
2. Burton, W., Meijer, E., Sansom, P., Thompson, S. and Wadler, P. (1996) Views: An Extension to Haskell Pattern Matching. Available from http://www.haskell.org/development/views.html.
3. Hinze, R. (2001) A simple implementation technique for priority search queues. In: Leroy, X. (editor), Proceedings 2001 International Conference on Functional Programming, pp. 110-121. Florence, Italy.
4. Okasaki, C. (1998) Views for Standard ML. The 1998 ACM SIGPLAN Workshop on ML, pp. 14-23. Baltimore, MD.