二叉树的实现，实现了前序，后续，中序排列-Binary tree implementation to achieve the pre-order, follow-up, the sequence alignment

用java实现的线性序列对齐算法（算法->动态规划的作业）-Java implementation of a linear sequence alignment algorithm (algorithm- dynamic programming job)

这是一个序列比对算法，两个序列，字符相同得两分，与空格匹配得一分，错配得0分，计算最高得分与匹配情况-This is a sequence alignment algorithm, two sequences of characters the same two points, and the match was a sub-space mismatch 0 points, the highest score of the match situation computing