ECET370 Lab 6 - ECET 370 Lab 6 - an Original and A++ Work !!!

ECET370 Lab 6iLAB OVERVIEWScenario and SummaryThe purpose of the lab exercises is to help the student acquire skills in developing programs that involve the use of binary trees. We will be concentrating primarily on binary search trees, or BSTs.DeliverablesThere are five exercises in this lab, although not all of them will be required for submission. Be sure to read the following instructions carefully.Exercise 1: No submission is required.Create a folder and name it Week 6 Lab. Inside this folder, create the subfolders Ex2, Ex3, Ex4, and Ex5. Place the solution to each of the four exercises required for submission in the corresponding subfolder. Compress the folder Week 6 Lab using a program like WinZip, and drop the resulting zipped folder into the Dropbox.Note that Exercises 2, 3, 4, and 5 require software development. Place in the corresponding folders only .java files. Do not submit the .class files or other files or folders that are generated by the IDE.Required SoftwareEclipseAccess the software at https://lab.devry.edu .

iLAB STEPS
Exercise 1: Lecture Review—Binary Search Tree
Back to Top
Create a project using the classes BinarySearchTree, Node, and Main in the Doc Sharing area labeled The BST. Compile the project, run it, and review the code that is given carefully. These programs test the code discussed in our lecture.
Exercise 2: An Improved BST Class
Back to Top
Modify the class BinarySearchTree so that it contains the toString method instead of the display method that was given originally. Remember that the toString method returns a string representation of the object properties. By implementing toString, a BinarySearchTree object can be displayed in a simple way using System.out.print or System.out.println. For example, if bst is a BinarySearchTree object, it can be printed using System.out.println(bst).
Exercise 3: Using a BST in an Application
Back to Top
Use a binary search tree to implement a dictionary that contains the keywords in the Java language. Test it. Note that you can use the programs from the previous exercises. For a list of the keywords in Java, visit site below.

In essence, the idea of this exercise is to modify the class BinarySearchTree to make it work for the string type. Once that is done, create a main class, define a BinarySearchTree object in it, and insert the Java keywords with successive calls to the method add. As we saw earlier in the course, a dictionary is a data structure where items are stored so they can be retrieved later when the need arises, and a binary search tree is a convenient data structure to use when implementing dictionaries because of its efficient operations.
Exercise 4: Recursion and Binary Trees
Back to Top
Add a recursive function nodeCount to the BinarySearchTree class that counts the nodes in the tree. Create a main class to test it.
Exercise 5: Using Properties of BSTs
Back to Top
Add a function getMax to the BinarySearchTree class that finds the maximum value stored in the tree. Create a main class to test it.

Here is compete solution for ECET370 Lab 6

If you have more questions, please contact me via email support@extutorials.com