#ifndef MYRECORD_AVL_H #define MYRECORD_AVL_H #include "avl.h" typedef struct { int count; float mean; float stddev; float median; } STATS; typedef struct { TNODE *root; STATS stats; } AVL; void merge_tree(TNODE **rootp1, TNODE **rootp2); void merge_data(AVL *t1, AVL *t2); void clear_avl(AVL *avl); #endif

This is myrecord_avl.h

#include #include #include #include #include "queue_stack.h" #include "avl.h" #include "myrecord_avl.h" void merge_tree(TNODE **rootp1, TNODE **rootp2) { // use recursive or iterative algorithm to traverse tree rootp2, // get record data of each node and insert into rootp1 } void merge_data(AVL *t1, AVL *t2) { merge_tree(&t1->root, &t2->root); // aggregate existing t1->stats and t2->stats, and then update t1->stats } void clear_avl(AVL *avl) { TNODE *root = avl->root; clear_tree(&root); avl->root = NULL; avl->stats.count = 0; avl->stats.mean = 0; avl->stats.stddev = 0; avl->stats.median = 0; }

This is myrecord_avl.c

PLEASE COMPLETE THE CODE