Suppose we define a binary tree node as follows: /struct for a single node in a binary tree. data contains the int stored in this node. left and right contain pointers to the left and right subtrees respectively. All of the ints stored in the left subtree is smaller than data All of the ints stored in the right subtree is larger than data. /struct node { int data: struct node *left: struct node *right: }: typedef struct node node: Write a iterative function maxExtract which finds and deletes the node with the largest data value. It should return the data value stored in that node. int maxExtract (node *tree){