Average depth in a binary search tree with repeated keys

Random sequences from alphabet $\{1, \ldots,r\}$ are examined where repeated letters are allowed. Binary search trees are formed from these, and the average left-going depth of the first $1$ is found. Next, the right-going depth of the first $r$ is examined, and finally a merge (or 'shuffle...

詳細記述

書誌詳細

出版年:	Discrete Mathematics & Theoretical Computer Science
主要な著者:	Margaret Archibald, Julien Clément
フォーマット:	論文
言語:	英語
出版事項:	Discrete Mathematics & Theoretical Computer Science 2006-01-01
主題:	binary search trees average case analysis repeated keys multiset shuffle product [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-co] mathematics [math]/combinatorics [math.co]
オンライン･アクセス:	https://dmtcs.episciences.org/3496/pdf