首页> 外文会议>International colloquium on automata, languages and programming >On the Concentration of the Height of Binary Search Trees
【24h】

On the Concentration of the Height of Binary Search Trees

机译:关于二元搜索树高度的浓度

获取原文

摘要

The expectation of the absolute value of the difference between the heights of two random binary search trees of n nodes is less than 6.25 for infinitely many n. Given a plausible assumption, this expectation is less than 4.96 for all but a finite number of values of n.
机译:对于N个节点的两个随机二进制搜索树的高度之间的绝对值的期望小于6.25,无数是不确定的n。鉴于合理的假设,所有的预期小于4.96,但是N的有限数量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号