Task $4$: Destroy the Tree: destroy

During add$\_$node$()$ we malloc$()\text{'}$ed a lot, so before exiting our program we need to free those spaces on

the heap by calling destroy$()$ :

$1$ void destroy$($tree$\_$t$*)$;

where tree$\_$t$*$ argument is the pointer to the tree. One thing to pay attention to is how many malloc$()$ we

used in add$\_$node$(),$ then we should free$()$ same amount of time. Also, for each node, what's the order of

multiple free$()\text{'}$s$?$

Again, it'll be easier to do that in recursion. You are free to create helper functions.

Note

We will emphasize this again: because this is a generic BST$,$ you must not use if$-$else to discriminate different

data types in your code. For example, the following is not allowed:

if sizeof data

Please write in C