Question generated for student with ID 0041896

  (You are responsible to check if your student number is correct!)
  Read carefully the binary tree implementation given in class. Using that given tree structure to dothe following problems:
  1. Write a function to search for a given value of a binary tree iteratively. That means no recursion is allowed here!
  2. Write a function to count the number of nodes of a given binary tree.
  3. Write a function that uses pre-order tranversal to place the values of the nodes in an array
    datatype pre_ordered[]
  4. Write a function to print a given binary tree on the screen. The function should output the tree in the format shown below.
            9          
                   
   6         20    
                   
1    8    11    24
  5. Write a function to delete the minimum value of a binary tree.
  You must also write a main function with other sufficient function calls to Insert() and Print() and several test cases to make sure your program performs properly! Each program should be in a seperate file with meaningfulcomments for your code. You may re-use as much code as needed for each part.