# By using which probability distribution is the optimal search tree a linear chain? [closed]

By using which probability distribution is the optimal search tree a linear chain?

-
Optimal with respect to what cost function? What does probability have to do with optimality? Why is "The uniform distribution over linear chains" not the only reasonable answer? – JɛﬀE Dec 2 '12 at 16:42
The question is not clear, I am closing it for now. Please clarify the question and flag it for moderator attention for reopening. – Kaveh Dec 6 '12 at 7:41

## closed as not a real question by JɛﬀE, Kaveh♦Dec 6 '12 at 7:41

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, see the FAQ.

I assume you want to minimize the expected access costs, i.e. $\sum_{0\leq i \leq n} i p_i$? I guess the solution is $p_0=1$ and all others $0$.