UOP ECET 370 Week 7 Lab 7 Binary Trees .pdf
Original filename: UOP ECET 370 Week 7 Lab 7 Binary Trees.pdf
This PDF 1.5 document has been generated by Microsoft® Office Word 2007, and has been sent on pdf-archive.com on 04/04/2016 at 10:00, from IP address 43.224.x.x.
The current document download page has been viewed 292 times.
File size: 304 KB (1 page).
Privacy: public file
Download original PDF file
UOP ECET 370 Week 7 Lab 7 Binary Trees
Check this A+ tutorial guideline at
For more classes visit
ECET 370 Week 7 Lab 7 Binary Trees
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
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
Exercise 4: Recursion and Binary Trees Write a recursive algorithm that counts the
nodes in a binary search tree.