ECET 370 Week 7 Lab 7 Binary Trees (Devry)
For more course tutorials visit www.ecet370.com Full set of lab with working programs. Exercise 1: Lecture review: Binary Search Tree Create a project using the classes BinarySearchTree, Node, and Main in the DocSharing 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 Modify the class BinarySearchTree so that it contains the toString method, instead of the display method that was given originally. Exercise 3: Using a BST in an application 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 http://java.sun.com/docs/books/tutorial/java/nutsandbolts/_keywords.html. Exercise 4: Recursion and Binary Trees Write a recursive algorithm that counts the nodes in a binary search tree. Exercise 5: Using properties of BSTs Write an algorithm getMax to find the maximum value stored in a binary search tree.
For more course tutorials visit
www.ecet370.com
Full set of lab with working programs.
Exercise 1: Lecture review: Binary Search Tree Create a project using the classes BinarySearchTree, Node, and Main in the DocSharing 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 Modify the class BinarySearchTree so that it contains the toString method, instead of the display method that was given originally.
Exercise 3: Using a BST in an application 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 http://java.sun.com/docs/books/tutorial/java/nutsandbolts/_keywords.html.
Exercise 4: Recursion and Binary Trees Write a recursive algorithm that counts the nodes in a binary search tree.
Exercise 5: Using properties of BSTs Write an algorithm getMax to find the maximum value stored in a binary search tree.
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
<strong>ECET</strong> <strong>370</strong> <strong>Week</strong> 7 <strong>Lab</strong> 7 <strong>Binary</strong> <strong>Trees</strong> (<strong>Devry</strong>)Click Here to Buy the Tutorialhttp://www.ecet<strong>370</strong>.com/product-23-<strong>ECET</strong>-<strong>370</strong>-<strong>Week</strong>-7-<strong>Lab</strong>-7-<strong>Binary</strong>-<strong>Trees</strong>For more course tutorials visitwww.ecet<strong>370</strong>.comFull set of lab with working programs.Exercise 1: Lecture review: <strong>Binary</strong> Search Tree Create a project usingthe classes <strong>Binary</strong>SearchTree, Node, and Main in the DocSharing arealabeled “The BST." Compile the project, run it, and review the codethat is given carefully. These programs test the code discussed in ourlecture.Exercise 2: An improved BST class Modify the class<strong>Binary</strong>SearchTree so that it contains the toString method, instead ofthe display method that was given originally.Exercise 3: Using a BST in an application Use a binary search tree toimplement a dictionary that contains the keywords in the Javalanguage. Test it. Note that you can use the programs from theprevious exercises. For a list of the keywords in Java, visithttp://java.sun.com/docs/books/tutorial/java/nutsandbolts/_keywords.html.Exercise 4: Recursion and <strong>Binary</strong> <strong>Trees</strong> Write a recursive algorithmthat counts the nodes in a binary search tree.Exercise 5: Using properties of BSTs Write an algorithm getMax tofind the maximum value stored in a binary search tree.
Change language