For finding an optimal binary search tree, we can use the same g

For finding an optimal binary search tree, we can use the same greedy algorithm as the one for building a Huffman tree. ~@[](1)

答案：FALSE