BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR2001-387
ENTRY:: March 01, 2008
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: A simple bound on the expected height of a randomly built binary search tree
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Aslam, Javed A.
DATE:: Sometime 2001
ABSTRACT:: 
NOTE:: 
Abstract and paper lost.
END:: ncstrl.dartmouthcs//TR2001-387