Question generated for student with ID 0343656

  (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 delete the minimum value of a binary tree.
  2. Write a function that searches for a given value of a binary tree and deletes it
  3. Write a function to calculate the sum of all the nodes of a given binary tree.
  4. Write a function to find the predecessor and successor of a given value of a binary tree.Definition : If node X has two children, its predecessor is the maximum value in its left subtree and its successor is the minimum value in its right subtree
  5. Write a function to calculate the depth of a given binary tree. That is how many levelsthe binary tree has.
  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.