This algorithm bases on an input alphabet of size 256. The adaptive compression algorith starts out with a tree that is well balanced. The tree is restructured using the bottom-up Splay operation. In general, fiels are compressed like this: java Compress and decompress like this: java Decompress . I'll use "diff infile outfile" to check the difference between files. Note that classes for reading, writing bits, main classes for both compression and decompression and support classes for printing binary trees will be provided. The files that I expect from you have 5: myBinaryTreeNode, myInternalNode, myLeafNode, myBinaryTree, mySplayCompressor. A detailed spec and a substantial portion of the code is attached. [AL]
## Deliverables
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Complete ownership and distribution copyrights to all work purchased.
## Platform
Java