期刊文献+

Limiting theorems for the nodes in binary search trees 被引量:1

Limiting theorems for the nodes in binary search trees
原文传递
导出
摘要 We consider three random variables X_n, Y_n and Z_n, which represent the numbers of the nodes with 0, 1, and 2 children, in the binary search trees of size n. The expectation and variance of the three above random variables are got, and it is also shown that X_n, Y_n and Z_n are all asymptotically normal as n→∞by applying the contraction method. We consider three random variables X n , Y n and Z n , which represent the numbers of the nodes with 0, 1, and 2 children, in the binary search trees of size n. The expectation and variance of the three above random variables are got, and it is also shown that X n , Y n and Z n are all asymptotically normal as n → ∞ by applying the contraction method.
出处 《Science China Mathematics》 SCIE 2008年第1期101-114,共14页 中国科学:数学(英文版)
基金 This work was supported by the National Natural Science Foundation of China (Grant No. 10671188) the Knowledge Innovation Program of the Chinese Academy of Sciences (Grant No. KJCX3-SYW-S02) the Special Foundation of University of Science and Technology of China
关键词 binary search tree NODES law of large numbers contraction method limiting distribution 60F05 05C80 binary search tree nodes law of large numbers contraction method limiting distribution
  • 相关文献

参考文献1

二级参考文献10

  • 1Aldous,D.& Pitman,J.,Inhomogeneous continuum random trees and the entrance boundary of the additive coalescent,Probab.Theory Relat.Fields,2000,118:455-482.
  • 2Devroye,L.,A note on the height of binary search trees,J.Assoc.Comput.Mach.,1986,33:489-498.
  • 3Fill,J.,Mahmoud,H.& Szpankowski,W.,On the distribution for the duration of a randomized leader election algorithm,Ann.Appl.Prob.,1996,6,1260-1283.
  • 4Itoh,Y.& Hosam,M.,One-side variations on interval trees,J.Appl.Prob.,2003,40:654-670.
  • 5Mahmoud,H.,Evolution of Random Seach Trees,John Wiley,New York,1992.
  • 6Mahmoud,H.,One-side variations on binary search trees,Ann.Inst.Statist.Math.,2003,55:885-900.
  • 7Petrov,V.V.,Limit Theorems of Probability Theory,Clarendon Press,Oxford,1995.
  • 8Prodinger,H.,How to select a loser,Discrete Math.,1993,120:149-159.
  • 9Rachev,S.T.,Probability Metrics and the Stability of Stochastic Models,Wiley,New York,1991.
  • 10Sibuya,M.& Itoh,Y.,Random sequential bisection and its associated binary tree,Ann.Inst.Statist.Math.,1987,39:69-84.

共引文献2

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部