The height of a binary search tree: the limiting distribution perspective.

From MaRDI portal
Publication:1853551

DOI10.1016/S0304-3975(01)00387-5zbMath1061.68039MaRDI QIDQ1853551

Charles Knessl, Wojciech Szpankowski

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)




Related Items (2)



Cites Work


This page was built for publication: The height of a binary search tree: the limiting distribution perspective.