Build and run your project. The program should compile without any errors. Note that function main() creates a new BST of int and inserts the nodes 12, 38, 25, 5, 15, 8, 55 (in that order) and displays them using pre-order traversal. Verify that the insertions are done correctly. You may verify it manually or use the visualization tool at https://www.cs.usfca.edu/~galles/visualization/BST.html. (Links to an external site.) Do the following: 1. add code to test the deleteNode and search member functions. Save screenshot of your test program run. 2. add code to implement the nodeCount member function of class BinaryTree. Test it and save screenshot of your test program run. 3. add code to implement the leafCount member function of class BinaryTree. Test it and save screenshot of your test program run. 4.The insert member function uses an iterative algorithm to insert a new value into the BST. Define a new insert function name it recursiveInsert that uses a recursive algorithm instead. Hint: watch video tutorials. Write a test program to test your function and save a screenshot of a test run showing your insert function works properly.
Create a new C++ project in Visual Studio (or an IDE of your choice). Add the files listed below to your project:
- BinaryTree.h Download BinaryTree.h
- BinarySearchTree.h Download BinarySearchTree.h
- main.cpp Download main.cpp
Build and run your project. The program should compile without any errors. Note that function main() creates a new BST of int and inserts the nodes 12, 38, 25, 5, 15, 8, 55 (in that order) and displays them using pre-order traversal. Verify that the insertions are done correctly. You may verify it manually or use the visualization tool at https://www.cs.usfca.edu/~galles/visualization/BST.html. (Links to an external site.)
Do the following:
1. add code to test the deleteNode and search member functions. Save screenshot of your test program run.
2. add code to implement the nodeCount member function of class BinaryTree. Test it and save screenshot of your test program run.
3. add code to implement the leafCount member function of class BinaryTree. Test it and save screenshot of your test program run.
4.The insert member function uses an iterative
Note: Do NOT use static variables in recursive functions.
Deliverables:
1. Source code of the functions in task 2, 3, and 4 in a text file
2. Screen shots of the test runs of Task 1, 2, 3, 4
3. Be sure to clear indicate if you have NOT completed any of the above tasks .
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 11 images
