assignment_week_7_.docx
Core Learning Outcomes addressed in this assignment:
· Demonstrate creativity and problem-solving skills. (9)
· Write C++ programs that use proper style and documentation. (10)
· Write C++ programs that uses a Stack and Linked List. (11)
Grading Information: This Lab Homework is worth 76 points and due by
Sunday of week 7
at midnight CST.
The purpose of this assignment is to assess if you can create a program that uses Trees and Binary Search Trees.
|
Directions
|
Points
|
|
The file must be called week7Prog.cpp
|
1
|
|
Main Method
1. Create Binary Search Tree that will accept integers in this order: 35, 18, 48, 72, 60, 25
2. Refer to page 537 Example 10-8 for example code.
3. Ask user for input and search tree utilizing integer input.
4. Return “True” if integer is found or “False” if number is not found in tree.
5. Methods utilized are up to your discretion.
6. See example below for desired output.
7. Include: system("PAUSE"); after your output to pause the screen.
|
70
|
|
Ensure you include ALL .cpp file(s) and any associated, student-defined .h (header) files required to make your program compile and run. The only files in the dropbox should be .cpp and .h files. Do not turn in .zip, .exe, .rar, etc files.
|
2
|
|
|
3
|
|
Total Possible Points 76
|
76
|
|
Example output of your program
Enter Integer to search for: 12
False
Enter Integer to search for: 60
True
|
|
w.2.a
