In Progress

Working With BinaryTrees

Using the Tree and BinaryTree code discussed in class, complete the assigned programming problem.

Project 3a:Working With First-Child Next-Sibling Tree Representation

Complete the required exercise using the [url removed, login to view] class presented in class as well as one of the choice exercises.

• (REQUIRED) Implement either a PreOrder or PostOrder TreeIterator using the TreeIterator class as the base class of the class you create.

• (CHOOSE ONE) Without using a TreeIterator, create a new method called isAncestor that takes two IComparables and returns true when the first one is the ancestor of the second. If either parameter is not found in the tree, your method should throw the InvalidTreeArgument exception. The prototype for this method should be: bool isAncestor( Type ancestor, Type descendant ) throws InvalidTreeArgument;

• (CHOOSE ONE) Without using a TreeIterator, create a new method called findMin that takes no arguments and returns the minimum IComparable found in this binary tree. If the root of the tree is null, your method should throw the InvalidTreeArgument exception. The prototype for this method should be: Type findMin( ) throws InvalidTreeArgument;

Create a test driver program that exercises each of these methods, prints the tree and the results of each operation.

Project 3b:Working With BinaryTrees

Complete the required exercise using the [url removed, login to view] class presented in class as well as one of the choice exercises.

• (REQUIRED) Implement a PreOrder or PostOrder TreeIterator using the TreeIterator class as the base class of the class you create.

• (CHOOSE ONE) Without using a TreeIterator, create a new method called level that takes no arguments and calculates the level value for this binary tree. Recall that the level value for a tree will match the greatest level value of each and every node in this tree. If the root of the tree is null, your method should throw the InvalidTreeArgument exception. The prototype for this method should be: bool level( ) throws InvalidTreeArgument;

•(CHOOSE ONE) Without using a TreeIterator, create a new method called isLeaf that takes an IComparable and attempts to located its corresponding TreeNode inside this tree. If it finds such a TreeNode, this method should return true if that TreeNode is in fact a leaf in this tree; return false otherwise. If the root of the tree is null, your method should throw the InvalidTreeArgument exception. The prototype for this method should be: bool isLeaf( Type data ) throws InvalidTreeArgument;

Create a test driver program that exercises each of these exercises and prints the tree before and after each operation.

Skills: Java

See more: working prototype, working for first data, type of binary tree, true results, tree node, tree ancestor, the ancestor tree, programming exercises java, operation of binary tree, no working, node prototype, node of a tree, node in tree, match problem, first ancestor, exercise programming, exercise java programming, c programming exercises, binary tree operation, binary tree leaf node, binary tree ancestor, binary problem, binary method problem, binary code tree, binary code test

About the Employer:
( 25 reviews ) LA, United States

Project ID: #1269794

Awarded to:

it2051229

HUX8”, XŒ ˜X 8XÐ @ ¸À| UxiÈä. ¬iÈä.

$50 USD in 0 days
(227 Reviews)
6.3

15 freelancers are bidding on average $67 for this job

IMSeriousBidder

Hello, I am senior Java developer, I can finish this project in one day please check you PMB Thanks

$40 USD in 1 day
(99 Reviews)
7.2
kevinxiaozi

Dear sir, I am strong in java programming especially in algorithm implementation and familiar with data structures. I have implemented binary search tree algorithms several times. I can show you demos and I can do t More

$30 USD in 1 day
(26 Reviews)
5.3
deadhunt

Please check PMB.

$40 USD in 1 day
(34 Reviews)
4.7
ezonelogic

I am java programmer and can do this assignment.

$30 USD in 1 day
(12 Reviews)
4.7
ranjitsinha

Ready to do it. Thanks.

$50 USD in 2 days
(78 Reviews)
4.6
pawel100

Hello, I'm interested in your project, Please check PMB for more details.

$30 USD in 2 days
(15 Reviews)
4.4
fahien

please check your inbox for my detailed message on the bid

$200 USD in 5 days
(14 Reviews)
4.2
LajosArpad

Hello, I'm interested in your project. If you need documentation about the code I can provide documentation too. Best regards, Lajos Arpad.

$150 USD in 2 days
(3 Reviews)
3.5
pavan45

Hi, I will help you. Please check your inbox. Regards, Pavan

$30 USD in 1 day
(2 Reviews)
1.6
escovadordebits

Leave it to me. Consider it done.

$30 USD in 1 day
(0 Reviews)
0.0
rakesh1981

I am a Sun Certified Java Programmer with 6+ years of experience . I have just started Free Lancing and this will be my ideal first project . I can complete the project without any issues . Let me know Thanks

$40 USD in 2 days
(0 Reviews)
0.0
bpcrao9

i can do it in 1 hour

$30 USD in 1 day
(0 Reviews)
0.0
freelancernadham

I have 10+ years of Java/J2EE experice and have 5 years of Data Structures experice. I can give the delivery in 2 dats.

$50 USD in 2 days
(0 Reviews)
0.0
OurHackerSpace

Please check your private messages.

$200 USD in 1 day
(0 Reviews)
0.0
nhthai2207

Hi sir! Please let me perform this project for you!

$30 USD in 1 day
(0 Reviews)
0.0