Sorted tree HW problem

Question

hi, i was wondering if someone could give me tips or pointer or even the solution :). all help is appreciated
if you know of a tutorial besides the basic java one that would be gr8 too
(2) Write a class named my_SortedTree with three methods.
(i) Given a sequence of numbers (total number of numbers will be the full tree size 2n-1), sort them in an increasing order.
(ii) Store the sorted sequence in a full binary tree so that use the �in order� traverse algorithm can print them in an increasing order. Note that your tree MUST be a full tree.
For example, given �14 23 13 18 11 26 16� as input, your program should sort them first, so that the sequence is �11 13 14 16 18 23 26�, then insert those seven numbers into tree structure one by one, it should be 1623181311 1426
(iii) Use the level-order traverse algorithm to print all of them.

Answer 1

hi, i was wondering if someone could give me tips or
pointer or even the solution :). all help is
appreciated
if you know of a tutorial besides the basic java one
that would be gr8 too
(2) Write a class named my_SortedTree with three
methods.
(i) Given a sequence of numbers (total number of
numbers will be the full tree size 2n-1), sort them
in an increasing order.
(ii) Store the sorted sequence in a full binary tree
so that use the �in order� traverse algorithm can
print them in an increasing order. Note that your
tree MUST be a full tree.
For example, given �14 23 13 18 11 26 16� as input,
your program should sort them first, so that the
sequence is �11 13 14 16 18 23 26�, then insert those
seven numbers into tree structure one by one, it
should be 1623181311 1426
(iii) Use the level-order traverse algorithm to print
all of them.
Here is a link to a pretty good tutorial example of ADT's in Java.
It covers stacks, queues, Binary Search Trees, and much more...
IMHO I would work through some of the examples and even diagram each step in the areas that are tough to visualize.
JJ