This needs to be in java. Thanks. You are to implement a binary search tree data structure. Your program should have a minimum of three classes (the node, the tree, and a driver). Your program should include the following abilities: Ability to add each name into a binary tree node – one at a time. Place each node into the tree following the general algorithm for binary tree insertion. (The minimum list of names to be used is on the next page). You may have the program load the names via a file read OR by hard code. In either case, you must enter the names 1 at a time using the “add” method you designed. Names will be read in/added in the EXACT order that they are listed. Ability to delete any name from the tree – one at a time. Ability to print out the tree in either order (alpha and reverse alpha) Ability to “search” the tree for a specific name. Return the number of probes (i.e. a look at a node). Each time you look at a node, it is considered a “probe”. Ability to “destroy” or clear out the tree The user should be able to add/delete/print/search/destroy as dynamically (menu driven) – please make sure you consider various scenarios (user could destroy then try to print – watch for these “issues”)

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

This needs to be in java. Thanks.

You are to implement a binary search tree data structure. Your program should have a minimum of three classes (the node, the tree, and a driver). Your program should include the following abilities:

Ability to add each name into a binary tree node – one at a time. Place each node into the tree following the general algorithm for binary tree insertion. (The minimum list of names to be used is on the next page). You may have the program load the names via a file read OR by hard code. In either case, you must enter the names 1 at a time using the “add” method you designed. Names will be read in/added in the EXACT order that they are listed.
Ability to delete any name from the tree – one at a time.
Ability to print out the tree in either order (alpha and reverse alpha)
Ability to “search” the tree for a specific name. Return the number of probes (i.e. a look at a node). Each time you look at a node, it is considered a “probe”.
Ability to “destroy” or clear out the tree
The user should be able to add/delete/print/search/destroy as dynamically (menu driven) – please make sure you consider various scenarios (user could destroy then try to print – watch for these “issues”)

After your program is fully functional, analyze your input data and hand-draw the binary tree as your program has (or will have) loaded it. You may use any graphics tool to do this. Please be neat. For each node in the tree (in your picture) give the # of probes to get there (you may optionally have your program print this out instead). It is expected that your program has: