No label defined (Q3317112)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3847396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3847396 |
Statements
1983
0 references
recurrence formula
0 references
binary tree searches
0 references
average path length
0 references
0.7571656107902527
0 references
0.7217607498168945
0 references
0.7128856778144836
0 references
0.7101264595985413
0 references
In the study of binary tree searches, one often wants to know the average path length. In so doing, one comes across the recurrence \[ X_ n = R_ n + \left( 2 / \binom{n}{2t+1}\right) \sum^{n}_{k=1} \binom{n- k}t \binom{k-1}t X_{k-1}. \] Here, \(n\) and \(t\) are integers with \(n\geq 2t+1\), \(t\geq0\); \(R_ n\) is defined by \(R_ n = Q(n)\sigma_ r(n)\), where \(\sigma_ r(n) = \sum_{1\leq i,<\cdots<i_ r\leq n}(i_1\ldots i_ r)^{-1}\), \(r\geq1,\) and \(Q(n)\) is a polynomial in \(n\). The author finds a particular solution to the non-homogeneous recurrence \(TX_ n=R_ n\) where \[ TX_ n = X_ n - \sum^{n}_{k=1} p_{n,k} X_{k-1} \] and \(p_{n,k}\) is the probability that the \(k\)-th node of the given \(n\)-node tree is chosen as the root. Finally, the author shows that the homogeneous recurrence \(TX_ n=0\) has \(X_ n=(-1)^ n \binom an\) as solution, where a is the solution to \((a-t)_{t+1} = -2(-1)^ t(2t+1)_{t+1}\).
0 references