using c program

1. Operations on Binary Trees Binary trees with integer keys are implemented by the classes Tree and Node, defined as follows: class Tree \{ Node root; } class Node\{ int key; Node left, right, parent; }, together with the method insert from the lecture. In this exercise, you are asked to develop additional methods on trees to this class. 4. static Tree buildFromArray (int [] A): returns a tree of minimal height whose nodes contain as keys exactly the entries of the array A, in the same order (with respect to inorder traversal) as in the array