c language data structures

1-) (15 pts.) Construct an AVL tree by inserting the following key values in the given order into an empty AVL tree. Draw each tree after each insertion separately. In the final AVL tree, perform postorder traversal. (Aagidaki deerleri srasyla bo bir AVL aacna eklersek AVL aacnn her admn iziniz Son aata ise postorder ilemi uygulaymz 50,25,10,5,7,62,55,20 2-) (20 pts.) Write a function that converts a given min heap which is implemented by arrays to a max heap. The prototype of the function is queue *convert(queue *q). Dizi ile implemente edilmis bir min heap i max heap e dnutrunuz