Title of article :
On the richness of the collection of subtrees in random binary search trees
Author/Authors :
Luc Devroye، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1998
Pages :
5
From page :
195
To page :
199
Keywords :
probabilistic analysis , computational complexity , Subtrees , Random binary search trees , Random permutation
Journal title :
Information Processing Letters
Serial Year :
1998
Journal title :
Information Processing Letters
Record number :
128840
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=128840
