Description
Assignment Goals
The goal of this project is to:
1. Continue practice with **linked storage**
2. Familiarize students with **trees**
3. Continue practice with **recursion**
Problem
Let’s practice working with trees!
### Overview
Randomly generate 100 *unique* values in the range of 1 to 200 and insert them into a binary search tree (BST). Print height and inorder, preorder, and postoder output of the BST tree.
Requirements
Deliverables
The Tree Interface and Node Class have already been provided for you in this repository. Your submission should include
– source code
– a *modular* main driver
– the ***complete*** linked implementation for a Binary Tree Class
– the ***complete*** linked implementation for a Binary Search Tree Class
– a makefile
– an output text file with
– the final height of the tree
– results from the inorder traversal
– results from the preorder traversal
– results from the postorder traversal
Submission details
If you are usinng git from the command line, execute the following commands:
1. After accepting the assignment invitation, copy the clone URL
2. Type
“`git clone clone URL“`
3. cd into your new assignment directory
4. After working on your files
5. When you’re ready, type the following commands:
“`
git add .
git commit -m “your commit message”
git push
“`
