Optimal search tree properties check?
Hello, I have the following task: Given the following search tree, in which the elements A;B;C;D;E are arranged lexicographically. Prove or disprove: The tree can be an optimal search tree with 2.1 expected comparisons. I and many others are stuck on this; most tend to believe the statement is false. We've formulated many equations for…