在java环境中，二元多项式计算完成计算并演示结果以及以二叉树形式进行存储-the environment, complete binary polynomial terms calculated and results of the demonstration in the form of binary tree storage

1.n个节点分段Lagrange插值多项式； 2.使用格式y=lagrange(x0,y0,x,k)； 3.输入项x0为n维插值节点向量，y0为n维被插函数值向量； 4.x为m维插值点向量，k为分段插值多项式次数，不超过3，缺省为k=1； 5.输出y为插值点x处的函数值；- 1.n a sub-node Lagrange interpolation polynomial 2. The use of the format y = lagrange (x0, y0,

java实现多项式加法，乘法，除法，利用辗转相除法求两个多项式的最大公因子-java achieve polynomial addition, multiplication, division, using Euclidean algorithm for greatest common divisor of two polynomials