@MISC {sofl,
    TITLE = {Proof that a randomly built binary search tree has logarithmic height},
    HOWPUBLISHED = {Computer Science Stack Exchange},
    NOTE = {URL:~\url{http://cs.stackexchange.com/q/6356}},
    EPRINT = {http://cs.stackexchange.com/q/6356},
    URL = {http://cs.stackexchange.com/q/6356}
}

@book{cormen,
 author = {Cormen, Thomas H. and Stein, Clifford and Rivest, Ronald L. and Leiserson, Charles E.},
 title = {Introduction to Algorithms},
 year = {2001},
 isbn = {0070131511},
 edition = {2nd},
 publisher = {McGraw-Hill Higher Education},
} 

@article{reed,
 author = {Reed, Bruce},
 title = {The Height of a Random Binary Search Tree},
 journal = {J. ACM},
 issue_date = {May 2003},
 volume = {50},
 number = {3},
 month = may,
 year = {2003},
 issn = {0004-5411},
 pages = {306--332},
 numpages = {27},
 url = {http://doi.acm.org/10.1145/765568.765571},
 doi = {10.1145/765568.765571},
 acmid = {765571},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {Binary search tree, asymptotics, height, probabilistic analysis, random tree, second moment method},
} 
