Skip to main content
OverflowAI is here! AI power for your Stack Overflow for Teams knowledge community. Learn more
1 vote

Can this Binary Search Tree be optimal with $x$ expected comparisons?

Suppose the probality of each element being searched by the node label itself is denoted by the node label itself. Then the expected cost is given by: $1\times A + 2\times B + 3\times D + 4\times (C+E)...
codeR's user avatar
  • 986

Only top scored, non community-wiki answers of a minimum length are eligible