I need a programmer to re-brand an application for me...

Question

Hi,
I need a programmer to re-brand an application for me...
I have the source code and am willing ot pay of course.
Please contact me at [email protected]
Thanks,
Morry

Answer 1

user13623097 wrote:
an alternative representation of a binary tree T is based on a special way for numbering the nodes of T. More specifically, the nodes in the binary tree T are numbered in increasing order level by level from left to right. For example, after this numbering system is applied to the binary tree given below
A
B          CWe obtain the following:
(1) A
(2) B        (3) CThis numbering function is called “Level Numbering” and can be described as follows. With every node v of T is associated an integer p(v) such that:
•     If v is the root, then p(v) = 1.
•     If v is the left child of node u, then p(v) = 2p(u).
•     If v is the right child of node u, then p(v) = 2p(u) + 1.
The level numbering function p suggests an implementation of a binary tree T via an ArrayList (or the ArrayVector class that we implemented in class). Such an implementation is both simple and efficient, as it allows you to easily provide an implementation for all the methods of the BinaryTree and Tree interfaces. As a matter of fact, by using simple arithmetic operations on the numbers p(v) associated with each node v involved in the operation, one can easily derive the numbers associated with the relatives of v.
Your job is to implement the binary tree ADT by using either the ArrayList class (part of the java.util package) or the ArrayVector class that we developed in class. Then, create a driver class whose main method instantiates a binary tree and adds several string objects to the tree. Make sure to call all the methods of the binary tree inside the main method and to define a toString() method for the tree allowing the client program to print out the elements stored in the treeSounds like homework.
I think it is fairly safe to assume if you attended classes
by now you ought to have all you need to implement what is being asked.