Ӧ�ø���ͳ�� 2006, 22(3) 304-310 DOI:      ISSN: 1001-4268 CN: 31-1256

����Ŀ¼ | ����Ŀ¼ | ������� | �߼�����                                                            [��ӡ��ҳ]   [�ر�]
Supporting info
Email Alert
Article by
Article by
Article by
�մ��� �Ѱ��䣬 ��Ⱥǿ:
ժҪ�� ����������������������ϲ�ͬ��С�������������ij��������ͬ��������. ���õݹ�ֲ���ʽ,�����ǵó������Ǹ�����Ŀ�������ͷ���\bd ���, ��ѹ�����ó������ǵ����ļ��޶���.
�ؼ����� ����������   ���ļ��޶���   ���ʷֲ��ľ���   ������.  
On the Subtrees of Random Binary Search Trees
SU Chun, MIAO Baiqi, FENG Qunqiang
Department of Statistics and Finance, University of Scienceand Technology of China
Abstract: The subtrees of various sizes and patterns in random binary search trees are
investigated in this paper. The expectations and variances of their numbers are
first derived from an essential recursive distributional equation. Applying the
contraction method, we show both of their asymptotic distributions are normal.
�ո����� 1900-01-01 �޻����� 1900-01-01 ����淢������  

ͨѶ����: �մ�


Copyright by Ӧ�ø���ͳ��