(Solved) : Please Complete Following Functions C Language Int Findminpath Struct Avltree Tree Type Pa Q29663060 . . . .

Please complete the following functions in C language:

int FindMinPath(struct AVLTree *tree, TYPE*path) = 10 points

void preorder(struct AVLnode *node, TYPE *min_cost, TYPE*path, int *path_len,
TYPE *candidate_path, int *c_path_len, TYPE sumDiff, TYPEparent_value) = 20 points

void printBreadthFirstTree(struct AVLTree*tree) = 20 points

——————————–main.c——————————————

#include <stdio.h>

#include <stdlib.h>

#include <assert.h>

#include <sys/time.h>

#include “avl.h”

void preorder(struct AVLnode *node, TYPE *min_cost, TYPE *path,int *m,

TYPE *candidate_path, int *n, TYPE sumDiff, TYPEparent_value);

TYPE absoluteDiff(TYPE a, TYPE b);

int FindMinPath(struct AVLTree *tree, TYPE *path);

void printBreadthFirstTree(struct AVLTree *tree);

/* ——————–

Finds the minimum-cost path in an AVL tree

Input arguments:

tree = pointer to the tree,

path = pointer to array that stores values of nodes along themin-

cost path,

Output: return the min-cost path length

pre: assume