0364774

Question generated for student with ID 0364774

(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:

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 
```
Write a function to delete the maximum value of a binary tree.
Write a function to build a binary tree from a given array of int.
Write a function to calculate the sum of all the nodes of a given binary tree.
If you have this question then your program have to use this new tree structure instead of the one given in class
```
typedef struct tree{
	datatype data;
	int descendands;
	struct tree *left, *right;
} tree;
```
Write a function that traverses the tree and initializes the member descendands when a node is visited. The value of descendands of a node is the number of descendants (children) of that node.

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.