this is fp tree algorithm in java

用Fp-tree这个结构来查找频繁项藉，不管在性能还是鲁棒性都比经典算法aprior算法优-With Fp-tree structure to find the frequent items of this by, whether in the performance and robustness of the algorithm is superior than the classical algorithm aprior