The program should then enable the user to select the following options: 1. display() 2. add() 3. delete() 4. find() 5. findLargest() 6. findSmallest() The program should loop the options till the user enter “000" as one of the options and the program should terminate.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
In java please
Description
Write two programs; a tester() program and a testTree().
You will be making a program that will hold the following data in a data structure. The data
structure will be making is a binary search tree (BST). Your testTree() should start with having
this methods below:
1. display()- Display information of the whole tree in INORDER traversal.
2. add()- Add a piece of data to your binary tree.
3. delete()- Delete a piece of data from the binary tree.
4. find()- Find a piece of data and print it.
5. findLargest()- Find and print the largest piece of data in the binary tree.
6. findSmallest()- Find and print the smallest piece of data in the binary tree.
On the tester() program you should start by adding the data below:
444, 555, 111, 888, 333, 999, 222, 666, 777
The program should then enable the user to select the following options:
1. display()
Transcribed Image Text:Description Write two programs; a tester() program and a testTree(). You will be making a program that will hold the following data in a data structure. The data structure will be making is a binary search tree (BST). Your testTree() should start with having this methods below: 1. display()- Display information of the whole tree in INORDER traversal. 2. add()- Add a piece of data to your binary tree. 3. delete()- Delete a piece of data from the binary tree. 4. find()- Find a piece of data and print it. 5. findLargest()- Find and print the largest piece of data in the binary tree. 6. findSmallest()- Find and print the smallest piece of data in the binary tree. On the tester() program you should start by adding the data below: 444, 555, 111, 888, 333, 999, 222, 666, 777 The program should then enable the user to select the following options: 1. display()
The program should then enable the user to select the following options:
1. display()
2. add()
3. delete()
4. find()
5. findLargest()
6. findSmallest(()
The program should loop the options till the user enter “000" as one of the options and the
program should terminate.
Transcribed Image Text:The program should then enable the user to select the following options: 1. display() 2. add() 3. delete() 4. find() 5. findLargest() 6. findSmallest(() The program should loop the options till the user enter “000" as one of the options and the program should terminate.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Graphical User Interface
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education