The root of an optimal binary search tree always contains the ke

The root of an optimal binary search tree always contains the key with the highest search probability. ~@[](3)

答案：FALSE