Huang and Wong [1984] proposed a polynomial-time dynamic-programming algorithm for computing optimal generalized binary split trees. We show that their algorithm is incorrect. Thus, it remains open whether such trees can be computed in polynomial time. Spuler [1994] proposed modifying Huang and Wong's algorithm to obtain an algorithm for a different problem: computing optimal two-way-comparison search trees. We show that the dynamic program underlying Spuler's algorithm is not valid, in that it does not satisfy the necessary optimal-substructure property and its proposed recurrence relation is incorrect. It remains unknown whether the algorithm is guaranteed to compute a correct overall solution.

翻译：Wang and Wong [1984] 提出了计算最佳普遍二分立树的多元时时动态程序设计算法。 我们证明它们的算法是不正确的。 因此,它仍然开放, 是否可以在多元时段计算这些树。 Spuler [1994] 提议修改黄黄黄和黄的算法,以便为不同的问题获得一种算法: 计算最佳双向比较搜索树。 我们显示, Spuler 算法所依据的动态程序无效, 因为它不能满足必要的最佳次结构属性, 且其拟议的复发关系不正确。 目前还不清楚该算法是否保证计算出正确的整体解决方案 。