在二分检索树中，为了把动态规划应用于得到一颗最优二分检索树的问题，需要把构造这样的一个数看成是一系列决策的结果，而且要能列出求取最优决策序列的递推式，可以帮助你了解最优成本二叉树的实现-In a binary search tree, dynamic programming is applied in order to get the best question a binary search tree, we need to construct a number such as a resul

ID3算法实现，构造决策树，并预测相应输出，应用领域广泛，商业经济领域，航空航天等领域。-ID3 algorithm to construct a decision tree, and predict the corresponding output, wide range of applications, business economics, aerospace and other fields.