Debug with Java binary tree

Completado Publicado Nov 4, 2002 Pagado a la entrega
Completado Pagado a la entrega

HI~~

I am looking for someone to help me with my Java code writing. Basically, what you have to do is to answer all the questions that I am going to have, help me when I get stuck and help me with debug.

I need someone able to communicate with me at least once per day or even more often. Thank you very much.

Below is just a brief decirption about my assignment

[1]

Prove that a binary tree with N nodes has N+1 null pointers.

[2]

The getNext function is used in the Network Management protocol SNMP. Given a Binary Search tree T holding integers, write a function getNext(T, n) that returns the smallest integer in T that is bigger than n. If there is no such integer, return n.

A sequence of calls to getNext can be used to traverse the tree, by feeding the result of the last search as a parameter to the new search.

[3]

Write a program that takes a tree whose nodes hold a single character and prints the tree as we would draw it. The Left offspring of a node should be below and to the left. The Right offspring should be below and to the right. For example, the tree ca.b..ed... would be printed as:

c

a e

b d

[4]

Given the pre-order and the in-order traversal of a tree it is possible to reconstruct the tree. Write a program that accepts two strings on the command line representing the in-order and pre-order representation of a binary tree. Echo print the two strings, then construct the binary tree they represent, and use the PrintLevel routine to display the tree's shape. The tree might not be a sorted binary tree.

[5] 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 [url removed, login to view] compress

it will produce the file [url removed, login to view], whose contents have been compressed using Huffman encoding. Given the input

% huffman [url removed, login to view] decompress

it will produce the decompressed file yourtext.

## 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.

4) I need to work be done by deadline

5) able to respond to my email within 24 hours

## Platform

Java JDK 1.31

## Deadline information

must be able to respond to me within a day

Ingeniería Java MySQL PHP Arquitectura de software Verificación de software

Nº del proyecto: #2881509

Sobre el proyecto

6 propuestas Proyecto remoto Activo Nov 5, 2002

Adjudicado a:

cinterosystems

See private message.

$17 USD en 14 días
(139 comentarios)
5.6

6 freelancers están ofertando un promedio de $26 por este trabajo

rozarus

See private message.

$29.75 USD en 14 días
(52 comentarios)
3.2
adifferentname

See private message.

$6.8 USD en 14 días
(5 comentarios)
2.4
easlern

See private message.

$25.5 USD en 14 días
(1 comentario)
0.0
rownakhasan

See private message.

$51 USD en 14 días
(0 comentarios)
0.0
nannasgroup

See private message.

$25.5 USD en 14 días
(2 comentarios)
0.0