Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

In this part, you have been asked to create a simple ADT tree. A company asked you to create a tree like the following: As

In this part, you have been asked to create a simple ADT tree. A company asked you to create a tree like the following: As you can see you need the following:

image text in transcribed

a Worker.java class, that only have name and salary attributes, you should have a constructor for this class.

You need a Binary TREE ADT class to hold the tree.

The Tree elements can have no children or many children (0,1,2,3,)

A binary tree ADT needs the following:

Constructor - Optional

root() - public Worker root() : Returns the root of the tree (or null if empty). [Returns object of Worker Type]

parent(p) - public Worker parent(Worker p) : Return the parent of worker p

left(p) - public Worker left(Worker p) : Return the left child of worker p

right(p) - public Worker right(Worker p) : Return the right child of worker p

setLeft(p) - public void setLeft(Worker p, Worker r) : Set the left child of worker p

setRight - public void setRight(Worker p, Worker r) : set the right child of worker p

size() : Return the size

You need to also write a method to print the tree (nothing fancy!!)

o You may do it in-order, preorder,

Last part, create a main

o create the workers with their name and salary

o Add them to the tree similar to image, remember to use setLeft and setRight

o Lastly use your print and print the tree

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Processing

Authors: David M. Kroenke

12th Edition International Edition

1292023422, 978-1292023427

More Books

Students also viewed these Databases questions