Second Homework:

Build a program that has the following functions:

1) Create: create a binary search tree.

2) Insert: Insert a number to the binary search tree.


4) print all the data in the tree to a file in ascending sorted order.


6- function that find the hight of the tree (I will explain this in class).

The main function:

** Read from the inputfile data (I attached the file) 10,000 number and insert them to the binary 

search tree. If u insert a number and the number exist: do not insert it again.

** The main function print all the item in ascending order in a file (sortedNumbers).

** The main function read the number to_delete_numbers file (I also attached this file). For each

number, first search for the number and if the number exist ==> delete the number from the tree.

 ** The main function print the hight of the tree.
 

I will give more hints in class. 

Deadline:  October 5.

 

Start work on it now. I will give more hints in class.

 

Good luck,

Diab.