Helping with Debug Java Binary Tree

HI~~ I need someone one to help to write the below java program and some other problems related to binary tree. I am going to try to write the program myself and your job is giong to help me when I get stuck. Mainly, I need that person to help me with debug and answer the question I have. Below is just a brief description about what I need. (1) Huffman Encoding This project uses Priority Queues, Binary Trees, and Bit Manipulations to provide a useful facility: file compression. You will implement Huffman encoding to compress a text file. Your program will take two parameter: a file name and the word "compress" or "decompress". Given the input % huffman [login to view URL] compress it will produce the file [login to view URL], whose contents have been compressed using Huffman encoding. Given the input % huffman [login to view URL] decompress it will produce the decompressed file yourtext. Decompressing a file whose name does not end in .huf should produce an error message. (There is a list of the errors your program should catch below.) The compressed file begins with a table that describes the encoding used. Your program should be able to exchange files with other programs. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased. 40 I need the 100% of work DONE bu due date. Not part of code or not what I am asking for. ## Platform JDK 1.3.1 HAVE TO WRITE THE CODE IN JAVA ## Deadline information I want the work to be done by deadline, 11/16/2002 When I send an email to you, I hope to get a respond within 24 hour