0

I'm trying to understand how to use an optimal binary search tree, but I'm a bit confused. Would this be an example of such a tree?

                    E
       A                      T
  S         N            I             O
M   U    C      L     D     R       H     S
        Z Q    X J   K V   B P     Y G   F W
Vadim Kotov
  • 8,084
  • 8
  • 48
  • 62
BenW
  • 737
  • 10
  • 41
  • The question is a bit unclear; what is the criterion for optimality here? If the path length of a letter in the tree should roughly correspond to the probability of the letter, then the tree looks fine by rough inspection. Please clarify. – Codor Sep 30 '16 at 14:45
  • Yes, the probability of the letters. – BenW Sep 30 '16 at 15:44

0 Answers0